Base | Representation |
---|---|
bin | 1011011001011011001100… |
… | …0101010010110110000000 |
3 | 1122100222210111022002210222 |
4 | 2312112303011102312000 |
5 | 3120303324033041000 |
6 | 42352505021042212 |
7 | 2432236241306633 |
oct | 266266305226600 |
9 | 48328714262728 |
10 | 12531424112000 |
11 | 3aa16022437a2 |
12 | 14a48106b6368 |
13 | 6cb928c74171 |
14 | 31474a437c1a |
15 | 16ae876d6a85 |
hex | b65b3152d80 |
12531424112000 has 128 divisors (see below), whose sum is σ = 31583054131200. Its totient is φ = 4943903846400.
The previous prime is 12531424111993. The next prime is 12531424112027. The reversal of 12531424112000 is 21142413521.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4196480 + ... + 6532479.
It is an arithmetic number, because the mean of its divisors is an integer number (246742610400).
Almost surely, 212531424112000 is an apocalyptic number.
12531424112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12531424112000 is an abundant number, since it is smaller than the sum of its proper divisors (19051630019200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12531424112000 is an equidigital number, since it uses as much as digits as its factorization.
12531424112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10729061 (or 10729039 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 12531424112000 its reverse (21142413521), we get a palindrome (12552566525521).
The spelling of 12531424112000 in words is "twelve trillion, five hundred thirty-one billion, four hundred twenty-four million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •