Base | Representation |
---|---|
bin | 1011000000011011111100… |
… | …1010100110011111110101 |
3 | 1120211221201020212202012122 |
4 | 2300012333022212133311 |
5 | 3041240130301201323 |
6 | 41423350344325325 |
7 | 2356231031361506 |
oct | 260067712463765 |
9 | 46757636782178 |
10 | 12102130100213 |
11 | 3946536a377aa |
12 | 1435582a73845 |
13 | 69a2c25c894a |
14 | 2dba638c2bad |
15 | 15ec0e16aec8 |
hex | b01bf2a67f5 |
12102130100213 has 2 divisors, whose sum is σ = 12102130100214. Its totient is φ = 12102130100212.
The previous prime is 12102130100191. The next prime is 12102130100273. The reversal of 12102130100213 is 31200103120121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11175929813764 + 926200286449 = 3343042^2 + 962393^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102130100213 - 26 = 12102130100149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12102130100191 and 12102130100200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102130100273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051065050106 + 6051065050107.
It is an arithmetic number, because the mean of its divisors is an integer number (6051065050107).
Almost surely, 212102130100213 is an apocalyptic number.
It is an amenable number.
12102130100213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102130100213 is an equidigital number, since it uses as much as digits as its factorization.
12102130100213 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 12102130100213 its reverse (31200103120121), we get a palindrome (43302233220334).
The spelling of 12102130100213 in words is "twelve trillion, one hundred two billion, one hundred thirty million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •