Base | Representation |
---|---|
bin | 11011000000110001… |
… | …100010101100001000 |
3 | 2202212100011200201100 |
4 | 123000301202230020 |
5 | 433400012011032 |
6 | 21154012421400 |
7 | 2044514033361 |
oct | 330061425410 |
9 | 82770150640 |
10 | 29004016392 |
11 | 1133401388a |
12 | 5755477860 |
13 | 2972c330a0 |
14 | 1592064b68 |
15 | b4b48c97c |
hex | 6c0c62b08 |
29004016392 has 192 divisors, whose sum is σ = 88436275200. Its totient is φ = 8526435840.
The previous prime is 29004016367. The next prime is 29004016403. The reversal of 29004016392 is 29361040092.
It is a super-3 number, since 3×290040163923 (a number of 32 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2285938 + ... + 2298590.
It is an arithmetic number, because the mean of its divisors is an integer number (460605600).
Almost surely, 229004016392 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 29004016392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44218137600).
29004016392 is an abundant number, since it is smaller than the sum of its proper divisors (59432258808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29004016392 is a wasteful number, since it uses less digits than its factorization.
29004016392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12788 (or 12781 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 36.
The spelling of 29004016392 in words is "twenty-nine billion, four million, sixteen thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •