Base | Representation |
---|---|
bin | 111000010001… |
… | …1101101111100 |
3 | 2001112002012200 |
4 | 1300203231330 |
5 | 30023201203 |
6 | 2532231500 |
7 | 505541400 |
oct | 160435574 |
9 | 61462180 |
10 | 29506428 |
11 | 15723686 |
12 | 9a6b590 |
13 | 6161433 |
14 | 3cc1100 |
15 | 28cc9a3 |
hex | 1c23b7c |
29506428 has 108 divisors (see below), whose sum is σ = 89008920. Its totient is φ = 8213184.
The previous prime is 29506403. The next prime is 29506481. The reversal of 29506428 is 82460592.
It is a happy number.
29506428 is a `hidden beast` number, since 2 + 9 + 5 + 0 + 642 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 29506392 and 29506401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 75658 + ... + 76046.
Almost surely, 229506428 is an apocalyptic number.
29506428 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29506428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44504460).
29506428 is an abundant number, since it is smaller than the sum of its proper divisors (59502492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29506428 is a wasteful number, since it uses less digits than its factorization.
29506428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456 (or 444 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 29506428 is about 5431.9819587329. The cubic root of 29506428 is about 309.0097712686.
The spelling of 29506428 in words is "twenty-nine million, five hundred six thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •