Base | Representation |
---|---|
bin | 1011001001001010110110… |
… | …1001010011111011110000 |
3 | 1121101021222002122010222110 |
4 | 2302102231221103323300 |
5 | 3101214410431003422 |
6 | 42020321542205320 |
7 | 2403121642541232 |
oct | 262225551237360 |
9 | 47337862563873 |
10 | 12252160016112 |
11 | 39a4125a09135 |
12 | 145a673723840 |
13 | 6ab4b2120a03 |
14 | 305017220252 |
15 | 163a906a960c |
hex | b24ada53ef0 |
12252160016112 has 40 divisors (see below), whose sum is σ = 31815410359504. Its totient is φ = 4062892437504.
The previous prime is 12252160016099. The next prime is 12252160016119. The reversal of 12252160016112 is 21161006125221.
It is a self number, because there is not a number n which added to its sum of digits gives 12252160016112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12252160016119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 661268803 + ... + 661287330.
Almost surely, 212252160016112 is an apocalyptic number.
12252160016112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12252160016112 is an abundant number, since it is smaller than the sum of its proper divisors (19563250343392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12252160016112 is a wasteful number, since it uses less digits than its factorization.
12252160016112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1322556337 (or 1322556331 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 30.
The spelling of 12252160016112 in words is "twelve trillion, two hundred fifty-two billion, one hundred sixty million, sixteen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •