Base | Representation |
---|---|
bin | 1011000110101110100101… |
… | …0110101111111100110011 |
3 | 1121020021200200020201211000 |
4 | 2301223221112233330303 |
5 | 3100023003300011011 |
6 | 41545143301053043 |
7 | 2400105303324240 |
oct | 261535126577463 |
9 | 47207620221730 |
10 | 12210212110131 |
11 | 398835a464542 |
12 | 14525073b7183 |
13 | 6a7558633679 |
14 | 302d980785c7 |
15 | 162937ba0356 |
hex | b1ae95aff33 |
12210212110131 has 64 divisors (see below), whose sum is σ = 21894191308800. Its totient is φ = 6574294080288.
The previous prime is 12210212110127. The next prime is 12210212110139. The reversal of 12210212110131 is 13101121201221.
It is a happy number.
12210212110131 is a `hidden beast` number, since 1 + 2 + 210 + 212 + 110 + 131 = 666.
It is not a de Polignac number, because 12210212110131 - 22 = 12210212110127 is a prime.
It is a super-2 number, since 2×122102121101312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12210212110139) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 20670561 + ... + 21253058.
It is an arithmetic number, because the mean of its divisors is an integer number (342096739200).
Almost surely, 212210212110131 is an apocalyptic number.
12210212110131 is a deficient number, since it is larger than the sum of its proper divisors (9683979198669).
12210212110131 is a wasteful number, since it uses less digits than its factorization.
12210212110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41923725 (or 41923719 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 12210212110131 its reverse (13101121201221), we get a palindrome (25311333311352).
The spelling of 12210212110131 in words is "twelve trillion, two hundred ten billion, two hundred twelve million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •