Base | Representation |
---|---|
bin | 111100011111101000… |
… | …1100001110001000000 |
3 | 110102022200200011000210 |
4 | 1320333101201301000 |
5 | 4112024102000430 |
6 | 135402522314120 |
7 | 12246206460342 |
oct | 1707721416100 |
9 | 412280604023 |
10 | 129910578240 |
11 | 50105153253 |
12 | 21216958940 |
13 | c3344c5b51 |
14 | 640566d292 |
15 | 35a509d2b0 |
hex | 1e3f461c40 |
129910578240 has 112 divisors (see below), whose sum is σ = 436728851712. Its totient is φ = 32605003776.
The previous prime is 129910578227. The next prime is 129910578263. The reversal of 129910578240 is 42875019921.
It is a happy number.
It is a super-2 number, since 2×1299105782402 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 129910578240.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 3963784 + ... + 3996423.
Almost surely, 2129910578240 is an apocalyptic number.
129910578240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
129910578240 is an abundant number, since it is smaller than the sum of its proper divisors (306818273472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
129910578240 is a wasteful number, since it uses less digits than its factorization.
129910578240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7960244 (or 7960234 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 48.
The spelling of 129910578240 in words is "one hundred twenty-nine billion, nine hundred ten million, five hundred seventy-eight thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •