Base | Representation |
---|---|
bin | 111100010111100110… |
… | …0000011110000000000 |
3 | 110101121212212101012012 |
4 | 1320233030003300000 |
5 | 4111001010142440 |
6 | 135320042152052 |
7 | 12236421563036 |
oct | 1705714036000 |
9 | 411555771165 |
10 | 129640709120 |
11 | 4aa8688961a |
12 | 211604b2628 |
13 | c2c0617790 |
14 | 63bb8a0556 |
15 | 358b541e65 |
hex | 1e2f303c00 |
129640709120 has 352 divisors, whose sum is σ = 354075321600. Its totient is φ = 45201752064.
The previous prime is 129640709111. The next prime is 129640709131. The reversal of 129640709120 is 21907046921.
It is a super-2 number, since 2×1296407091202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90720566 + ... + 90721994.
It is an arithmetic number, because the mean of its divisors is an integer number (1005895800).
Almost surely, 2129640709120 is an apocalyptic number.
129640709120 is a gapful number since it is divisible by the number (10) 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 129640709120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177037660800).
129640709120 is an abundant number, since it is smaller than the sum of its proper divisors (224434612480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129640709120 is a wasteful number, since it uses less digits than its factorization.
129640709120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1543 (or 1525 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 41.
The spelling of 129640709120 in words is "one hundred twenty-nine billion, six hundred forty million, seven hundred nine thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •