Base | Representation |
---|---|
bin | 10110100010101011… |
… | …11101111000001101 |
3 | 1011020102021222000222 |
4 | 23101111331320031 |
5 | 144241121144323 |
6 | 5320514401125 |
7 | 605621263244 |
oct | 132125757015 |
9 | 34212258028 |
10 | 12102131213 |
11 | 5150379337 |
12 | 2418b901a5 |
13 | 11ab3733b3 |
14 | 82b40595b |
15 | 4ac6e69c8 |
hex | 2d157de0d |
12102131213 has 2 divisors, whose sum is σ = 12102131214. Its totient is φ = 12102131212.
The previous prime is 12102131179. The next prime is 12102131221. The reversal of 12102131213 is 31213120121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6815823364 + 5286307849 = 82558^2 + 72707^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102131213 - 210 = 12102130189 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12102131191 and 12102131200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102131233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051065606 + 6051065607.
It is an arithmetic number, because the mean of its divisors is an integer number (6051065607).
Almost surely, 212102131213 is an apocalyptic number.
It is an amenable number.
12102131213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102131213 is an equidigital number, since it uses as much as digits as its factorization.
12102131213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12102131213 its reverse (31213120121), we get a palindrome (43315251334).
The spelling of 12102131213 in words is "twelve billion, one hundred two million, one hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •