Base | Representation |
---|---|
bin | 10110100010101101… |
… | …01100011101011101 |
3 | 1011020102122122202122 |
4 | 23101112230131131 |
5 | 144241143301023 |
6 | 5320522432325 |
7 | 605623016435 |
oct | 132126543535 |
9 | 34212578678 |
10 | 12102322013 |
11 | 5150499721 |
12 | 24190626a5 |
13 | 11ab40c1b2 |
14 | 82b4552c5 |
15 | 4ac7332c8 |
hex | 2d15ac75d |
12102322013 has 2 divisors, whose sum is σ = 12102322014. Its totient is φ = 12102322012.
The previous prime is 12102321997. The next prime is 12102322019. The reversal of 12102322013 is 31022320121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11078194009 + 1024128004 = 105253^2 + 32002^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102322013 - 24 = 12102321997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12102321982 and 12102322000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102322019) 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, 6051161006 + 6051161007.
It is an arithmetic number, because the mean of its divisors is an integer number (6051161007).
Almost surely, 212102322013 is an apocalyptic number.
It is an amenable number.
12102322013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102322013 is an equidigital number, since it uses as much as digits as its factorization.
12102322013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12102322013 its reverse (31022320121), we get a palindrome (43124642134).
The spelling of 12102322013 in words is "twelve billion, one hundred two million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •