Base | Representation |
---|---|
bin | 1010000100000110100110… |
… | …00010011001111100001111 |
3 | 2220100201112020002021220112 |
4 | 11002003103002121330033 |
5 | 10400044210301211421 |
6 | 115022534414310235 |
7 | 4442633032162115 |
oct | 502032302317417 |
9 | 86321466067815 |
10 | 22131212132111 |
11 | 706288131a825 |
12 | 25952161b837b |
13 | c46c6c8a1264 |
14 | 567229183ab5 |
15 | 285a3c30c45b |
hex | 1420d3099f0f |
22131212132111 has 4 divisors (see below), whose sum is σ = 22202373586224. Its totient is φ = 22060050678000.
The previous prime is 22131212132101. The next prime is 22131212132131. The reversal of 22131212132111 is 11123121213122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22131212132111 - 26 = 22131212132047 is a prime.
It is a super-2 number, since 2×221312121321112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22131212132101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35580726590 + ... + 35580727211.
It is an arithmetic number, because the mean of its divisors is an integer number (5550593396556).
Almost surely, 222131212132111 is an apocalyptic number.
22131212132111 is a deficient number, since it is larger than the sum of its proper divisors (71161454113).
22131212132111 is an equidigital number, since it uses as much as digits as its factorization.
22131212132111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71161454112.
The product of its digits is 288, while the sum is 23.
Adding to 22131212132111 its reverse (11123121213122), we get a palindrome (33254333345233).
The spelling of 22131212132111 in words is "twenty-two trillion, one hundred thirty-one billion, two hundred twelve million, one hundred thirty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •