Base | Representation |
---|---|
bin | 111100001111001000… |
… | …0010001110000000000 |
3 | 110100220002021020222220 |
4 | 1320132100101300000 |
5 | 4104410242233433 |
6 | 135231532531040 |
7 | 12226401656340 |
oct | 1703620216000 |
9 | 410802236886 |
10 | 129356602368 |
11 | 4a95047aa54 |
12 | 210a1320a80 |
13 | c2767c2a86 |
14 | 6391c66d20 |
15 | 35716222b3 |
hex | 1e1e411c00 |
129356602368 has 352 divisors, whose sum is σ = 418693183488. Its totient is φ = 34661990400.
The previous prime is 129356602327. The next prime is 129356602399. The reversal of 129356602368 is 863206653921.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 129356602368.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 157559398 + ... + 157560218.
Almost surely, 2129356602368 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 129356602368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209346591744).
129356602368 is an abundant number, since it is smaller than the sum of its proper divisors (289336581120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129356602368 is a wasteful number, since it uses less digits than its factorization.
129356602368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1299 (or 1281 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 51.
The spelling of 129356602368 in words is "one hundred twenty-nine billion, three hundred fifty-six million, six hundred two thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •