Base | Representation |
---|---|
bin | 111100011001101000… |
… | …0011001101111000000 |
3 | 110101210122021201010221 |
4 | 1320303100121233000 |
5 | 4111120443102413 |
6 | 135330521032424 |
7 | 12241210640230 |
oct | 1706320315700 |
9 | 411718251127 |
10 | 129708956608 |
11 | 50011362a00 |
12 | 2117b325714 |
13 | c3017c16ca |
14 | 63c6987cc0 |
15 | 359252368d |
hex | 1e33419bc0 |
129708956608 has 336 divisors, whose sum is σ = 350806341312. Its totient is φ = 46389657600.
The previous prime is 129708956603. The next prime is 129708956639. The reversal of 129708956608 is 806659807921.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (129708956603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 37781260 + ... + 37784692.
It is an arithmetic number, because the mean of its divisors is an integer number (1044066492).
Almost surely, 2129708956608 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 129708956608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175403170656).
129708956608 is an abundant number, since it is smaller than the sum of its proper divisors (221097384704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129708956608 is a wasteful number, since it uses less digits than its factorization.
129708956608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3532 (or 3511 counting only the distinct ones).
The product of its (nonzero) digits is 13063680, while the sum is 61.
The spelling of 129708956608 in words is "one hundred twenty-nine billion, seven hundred eight million, nine hundred fifty-six thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •