Base | Representation |
---|---|
bin | 111100010111101111… |
… | …1000001111101001000 |
3 | 110101122020020001101121 |
4 | 1320233133001331020 |
5 | 4111003243320004 |
6 | 135320340525024 |
7 | 12236512055512 |
oct | 1705737017510 |
9 | 411566201347 |
10 | 129645682504 |
11 | 4aa89676158 |
12 | 211620b0774 |
13 | c2c1669400 |
14 | 63bc3d6bb2 |
15 | 358bbc5854 |
hex | 1e2f7c1f48 |
129645682504 has 96 divisors (see below), whose sum is σ = 273018249000. Its totient is φ = 57620699136.
The previous prime is 129645682501. The next prime is 129645682547. The reversal of 129645682504 is 405286546921.
It can be written as a sum of positive squares in 12 ways, for example, as 1631998404 + 128013684100 = 40398^2 + 357790^2 .
It is a Harshad number since it is a multiple of its sum of digits (52).
It is not an unprimeable number, because it can be changed into a prime (129645682501) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15561412 + ... + 15569740.
Almost surely, 2129645682504 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 129645682504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136509124500).
129645682504 is an abundant number, since it is smaller than the sum of its proper divisors (143372566496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129645682504 is a wasteful number, since it uses less digits than its factorization.
129645682504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8787 (or 8770 counting only the distinct ones).
The product of its (nonzero) digits is 4147200, while the sum is 52.
The spelling of 129645682504 in words is "one hundred twenty-nine billion, six hundred forty-five million, six hundred eighty-two thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •