Base | Representation |
---|---|
bin | 1011011001010010101110… |
… | …0000001110110100000000 |
3 | 1122100202220222011102100001 |
4 | 2312110223200032310000 |
5 | 3120234144231101000 |
6 | 42351451203405344 |
7 | 2432126001220300 |
oct | 266245340166400 |
9 | 48322828142301 |
10 | 12529149472000 |
11 | 3aa0645274027 |
12 | 14a4296983854 |
13 | 6cb65593b035 |
14 | 3145b22cb600 |
15 | 16ada2b7446a |
hex | b652b80ed00 |
12529149472000 has 864 divisors, whose sum is σ = 37632359890944. Its totient is φ = 4140122112000.
The previous prime is 12529149471977. The next prime is 12529149472067. The reversal of 12529149472000 is 27494192521.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 18616863664 + ... + 18616864336.
It is an arithmetic number, because the mean of its divisors is an integer number (43555972096).
Almost surely, 212529149472000 is an apocalyptic number.
12529149472000 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 12529149472000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18816179945472).
12529149472000 is an abundant number, since it is smaller than the sum of its proper divisors (25103210418944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12529149472000 is an equidigital number, since it uses as much as digits as its factorization.
12529149472000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1132 (or 1101 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 12529149472000 in words is "twelve trillion, five hundred twenty-nine billion, one hundred forty-nine million, four hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •