Base | Representation |
---|---|
bin | 1011000000011100010010… |
… | …1101110100110110100011 |
3 | 1120211221221202002201201111 |
4 | 2300013010231310312203 |
5 | 3041240323121021011 |
6 | 41423403512244151 |
7 | 2356233242030242 |
oct | 260070455646643 |
9 | 46757852081644 |
10 | 12102223220131 |
11 | 394658455a110 |
12 | 14355aa0a0657 |
13 | 69a3089a09a5 |
14 | 2dba72002959 |
15 | 15ec17412121 |
hex | b01c4b74da3 |
12102223220131 has 32 divisors (see below), whose sum is σ = 14074286284800. Its totient is φ = 10290240324000.
The previous prime is 12102223220119. The next prime is 12102223220167. The reversal of 12102223220131 is 13102232220121.
It is not a de Polignac number, because 12102223220131 - 25 = 12102223220099 is a prime.
It is a super-2 number, since 2×121022232201312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12102223220531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 336988066 + ... + 337023976.
It is an arithmetic number, because the mean of its divisors is an integer number (439821446400).
Almost surely, 212102223220131 is an apocalyptic number.
12102223220131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12102223220131 is a deficient number, since it is larger than the sum of its proper divisors (1972063064669).
12102223220131 is a wasteful number, since it uses less digits than its factorization.
12102223220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56431.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12102223220131 its reverse (13102232220121), we get a palindrome (25204455440252).
The spelling of 12102223220131 in words is "twelve trillion, one hundred two billion, two hundred twenty-three million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •