Base | Representation |
---|---|
bin | 11011111001100100… |
… | …011111100110000000 |
3 | 2212022202012001101100 |
4 | 123321210133212000 |
5 | 442322431202102 |
6 | 21432332134400 |
7 | 2110234265400 |
oct | 337144374600 |
9 | 85282161340 |
10 | 29956897152 |
11 | 11782984246 |
12 | 5980607400 |
13 | 2a95483160 |
14 | 1642828800 |
15 | ba4e62a1c |
hex | 6f991f980 |
29956897152 has 288 divisors, whose sum is σ = 107994584880. Its totient is φ = 7900526592.
The previous prime is 29956897129. The next prime is 29956897169. The reversal of 29956897152 is 25179865992.
It is a tau number, because it is divible by the number of its divisors (288).
It is a super-2 number, since 2×299568971522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 29956897152.
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, 713413 + ... + 754235.
Almost surely, 229956897152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 29956897152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53997292440).
29956897152 is an abundant number, since it is smaller than the sum of its proper divisors (78037687728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29956897152 is a wasteful number, since it uses less digits than its factorization.
29956897152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40870 (or 40848 counting only the distinct ones).
The product of its digits is 24494400, while the sum is 63.
The spelling of 29956897152 in words is "twenty-nine billion, nine hundred fifty-six million, eight hundred ninety-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •