Base | Representation |
---|---|
bin | 10110100010101100… |
… | …10011110100101101 |
3 | 1011020102110112100011 |
4 | 23101112103310231 |
5 | 144241132033401 |
6 | 5320520333221 |
7 | 605622116305 |
oct | 132126236455 |
9 | 34212415304 |
10 | 12102221101 |
11 | 515042a923 |
12 | 2419014211 |
13 | 11ab3a5299 |
14 | 82b42a605 |
15 | 4ac713451 |
hex | 2d1593d2d |
12102221101 has 4 divisors (see below), whose sum is σ = 12519539100. Its totient is φ = 11684903104.
The previous prime is 12102221039. The next prime is 12102221111. The reversal of 12102221101 is 10112220121.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10112220121 = 701 ⋅14425421.
It can be written as a sum of positive squares in 2 ways, for example, as 4546265476 + 7555955625 = 67426^2 + 86925^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102221101 - 29 = 12102220589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12102221111) 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, 208658956 + ... + 208659013.
It is an arithmetic number, because the mean of its divisors is an integer number (3129884775).
Almost surely, 212102221101 is an apocalyptic number.
It is an amenable number.
12102221101 is a deficient number, since it is larger than the sum of its proper divisors (417317999).
12102221101 is an equidigital number, since it uses as much as digits as its factorization.
12102221101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 417317998.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12102221101 its reverse (10112220121), we get a palindrome (22214441222).
The spelling of 12102221101 in words is "twelve billion, one hundred two million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •