Base | Representation |
---|---|
bin | 1011000110101110010010… |
… | …1010001100110100000101 |
3 | 1121020021111011222221012121 |
4 | 2301223210222030310011 |
5 | 3100022323112314023 |
6 | 41545131404245541 |
7 | 2400103325542213 |
oct | 261534452146405 |
9 | 47207434887177 |
10 | 12210133323013 |
11 | 3988319a4161a |
12 | 14524a4b408b1 |
13 | 6a7545209382 |
14 | 302d8b809cb3 |
15 | 162930cdad5d |
hex | b1ae4a8cd05 |
12210133323013 has 2 divisors, whose sum is σ = 12210133323014. Its totient is φ = 12210133323012.
The previous prime is 12210133322977. The next prime is 12210133323019. The reversal of 12210133323013 is 31032333101221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11643061069249 + 567072253764 = 3412193^2 + 753042^2 .
It is an emirp because it is prime and its reverse (31032333101221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12210133323013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210133323019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105066661506 + 6105066661507.
It is an arithmetic number, because the mean of its divisors is an integer number (6105066661507).
Almost surely, 212210133323013 is an apocalyptic number.
It is an amenable number.
12210133323013 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210133323013 is an equidigital number, since it uses as much as digits as its factorization.
12210133323013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12210133323013 its reverse (31032333101221), we get a palindrome (43242466424234).
The spelling of 12210133323013 in words is "twelve trillion, two hundred ten billion, one hundred thirty-three million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •