Base | Representation |
---|---|
bin | 11011000011010110… |
… | …010011011100000000 |
3 | 2202222100110001000200 |
4 | 123003112103130000 |
5 | 433442041121210 |
6 | 21202154245200 |
7 | 2045550122451 |
oct | 330326233400 |
9 | 82870401020 |
10 | 29047207680 |
11 | 11356434067 |
12 | 5767a26800 |
13 | 297bb7636a |
14 | 1597aa9128 |
15 | b501700c0 |
hex | 6c3593700 |
29047207680 has 432 divisors, whose sum is σ = 104258962080. Its totient is φ = 7461273600.
The previous prime is 29047207649. The next prime is 29047207681. The reversal of 29047207680 is 8670274092.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29047207681) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 42036135 + ... + 42036825.
It is an arithmetic number, because the mean of its divisors is an integer number (241340190).
Almost surely, 229047207680 is an apocalyptic number.
29047207680 is a gapful number since it is divisible by the number (20) 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 29047207680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52129481040).
29047207680 is an abundant number, since it is smaller than the sum of its proper divisors (75211754400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
29047207680 is a wasteful number, since it uses less digits than its factorization.
29047207680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 848 (or 831 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The spelling of 29047207680 in words is "twenty-nine billion, forty-seven million, two hundred seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •