NUMBER BASED PROGRAMS
1. Armstrong Number
- A number is an Armstrong number if the sum of its digits raised to the power of the number of digits
equals the number itself.
- Example: `153` → (1^3 + 5^3 + 3^3 = 153).
---
2. Perfect Number
- A perfect number is a number whose sum of its proper divisors (excluding itself) equals the number.
- Example: `6` → Divisors are `1, 2, 3` → (1 + 2 + 3 = 6).
3. Palindrome Number
- A palindrome number reads the same forward and backward.
- Example: `121` → Reverse is also `121`.
4. Prime Number
- A prime number is a number greater than 1 that has no divisors other than 1 and itself.
- Example: `7` → Divisors are `1, 7`.
5. Strong Number
- A number is a strong number if the sum of the factorials of its digits equals the number itself.
- Example: `145` → (1! + 4! + 5! = 145).
6. Harshad (Niven) Number
- A Harshad number is divisible by the sum of its digits.
- Example: `18` → Sum of digits is (1 + 8 = 9), and (18 mod 9 = 0).
7. Automorphic Number
- A number is automorphic if its square ends with the number itself.
- Example: `25` → (25^2 = 625), ends with `25`.
8. Happy Number
- A happy number repeatedly replaces the number with the sum of the squares of its digits until it
becomes 1 (happy) or loops endlessly (unhappy).
- Example: `19` → (1^2 + 9^2 = 82 → 8^2 + 2^2 = 68 → ... → 1).
9. Fibonacci Number
- A Fibonacci sequence starts with 0 and 1, and each subsequent number is the sum of the previous
two.
- Example: `0, 1, 1, 2, 3, 5, 8, 13...`.
10. Kaprekar Number
- A Kaprekar number's square can be split into two parts that add up to the number.
- Example: `45` → (45^2 = 2025) → (20 + 25 = 45).
11. Duck Number
- A number is a Duck number if it contains a zero but does not start with zero.
- Example: `102`, `305`.
12. Spy Number
- A number is a Spy number if the sum of its digits equals the product of its digits.
- Example: `112` → (1 + 1 + 2 = 4) and (1 times 1 times 2 = 4).
13. Neon Number
- A number is Neon if the sum of the digits of its square is equal to the number.
- Example: `9` → (9^2 = 81), (8 + 1 = 9).
14. Evil Number
- A number is Evil if it has an even number of `1`s in its binary representation.
- Example: `9` → Binary: `1001`, has two `1`s.
15. Deficient, Perfect, and Abundant Numbers
- Deficient: Sum of divisors < Number (e.g., 8).
- Perfect: Sum of divisors = Number (e.g., 6).
- Abundant: Sum of divisors > Number (e.g., 12).
16. Smith number:
Example 1: 4 (Smith Number)
Prime factorization of 4: 2 × 2
Sum of digits of prime factors: 2 + 2 = 4
Sum of digits of 4: 4
Since the sums are equal, 4 is a Smith number.
17. Buzz number:
A Buzz number is a number that is divisible by 7 or ends with the digit 7.
Example 1: 7 (Buzz Number)
Divisibility by 7: 7 ÷ 7 = 1 (divisible by 7).
Ends with 7: Yes, the number ends with 7.
Since the number satisfies both conditions, 7 is a Buzz number.
18. Tech number:
.A Tech number is a 2-digit number that can be split into two equal parts, and the sum of those parts
squared equals the original number.
Example 2: 81 (Tech Number)
The number 81 can be split into a=8,b = 1.
Sum of digits: 8+1=9
Square of the sum: 9^2 = 81
Since 9^2 = 81, 81 is a tech number.
