Base | Representation |
---|---|
bin | 10110100010101100… |
… | …10100000100100001 |
3 | 1011020102110120201122 |
4 | 23101112110010201 |
5 | 144241132101423 |
6 | 5320520342025 |
7 | 605622122252 |
oct | 132126240441 |
9 | 34212416648 |
10 | 12102222113 |
11 | 5150430663 |
12 | 2419014915 |
13 | 11ab3a5897 |
14 | 82b42ab29 |
15 | 4ac7138c8 |
hex | 2d1594121 |
12102222113 has 4 divisors (see below), whose sum is σ = 12113356800. Its totient is φ = 12091087428.
The previous prime is 12102222107. The next prime is 12102222137. The reversal of 12102222113 is 31122220121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12102222113 - 224 = 12085444897 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12102222091 and 12102222100.
It is not an unprimeable number, because it can be changed into a prime (12102222163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5565713 + ... + 5567886.
It is an arithmetic number, because the mean of its divisors is an integer number (3028339200).
Almost surely, 212102222113 is an apocalyptic number.
It is an amenable number.
12102222113 is a deficient number, since it is larger than the sum of its proper divisors (11134687).
12102222113 is a wasteful number, since it uses less digits than its factorization.
12102222113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11134686.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 12102222113 its reverse (31122220121), we get a palindrome (43224442234).
The spelling of 12102222113 in words is "twelve billion, one hundred two million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •