Base | Representation |
---|---|
bin | 1010111010100011101010… |
… | …0100001110100001010101 |
3 | 1120111021222202210222100021 |
4 | 2232220322210032201111 |
5 | 3033111244011401323 |
6 | 41305123341145141 |
7 | 2346023654033545 |
oct | 256507244164125 |
9 | 46437882728307 |
10 | 12001121200213 |
11 | 390771305a152 |
12 | 1419a9325b1b1 |
13 | 690915a84072 |
14 | 2d6c00879325 |
15 | 15c29b59305d |
hex | aea3a90e855 |
12001121200213 has 2 divisors, whose sum is σ = 12001121200214. Its totient is φ = 12001121200212.
The previous prime is 12001121200193. The next prime is 12001121200241. The reversal of 12001121200213 is 31200212110021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7299409834564 + 4701711365649 = 2701742^2 + 2168343^2 .
It is an emirp because it is prime and its reverse (31200212110021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12001121200213 - 217 = 12001121069141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12001121200273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000560600106 + 6000560600107.
It is an arithmetic number, because the mean of its divisors is an integer number (6000560600107).
Almost surely, 212001121200213 is an apocalyptic number.
It is an amenable number.
12001121200213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12001121200213 is an equidigital number, since it uses as much as digits as its factorization.
12001121200213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 12001121200213 its reverse (31200212110021), we get a palindrome (43201333310234).
The spelling of 12001121200213 in words is "twelve trillion, one billion, one hundred twenty-one million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •