Base | Representation |
---|---|
bin | 11101000111101011011… |
… | …101010001001111101101 |
3 | 21002022012210201100021012 |
4 | 131013223131101033231 |
5 | 230241233142024323 |
6 | 4131144114315005 |
7 | 264401242202633 |
oct | 35075335211755 |
9 | 7068183640235 |
10 | 2001110111213 |
11 | 701736541874 |
12 | 2839b3888a65 |
13 | 11691c545405 |
14 | 6cbd60a1353 |
15 | 370c06ae678 |
hex | 1d1eb7513ed |
2001110111213 has 2 divisors, whose sum is σ = 2001110111214. Its totient is φ = 2001110111212.
The previous prime is 2001110111197. The next prime is 2001110111227. The reversal of 2001110111213 is 3121110111002.
It is an a-pointer prime, because the next prime (2001110111227) can be obtained adding 2001110111213 to its sum of digits (14).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1736011786084 + 265098325129 = 1317578^2 + 514877^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001110111213 - 24 = 2001110111197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001110101213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000555055606 + 1000555055607.
It is an arithmetic number, because the mean of its divisors is an integer number (1000555055607).
Almost surely, 22001110111213 is an apocalyptic number.
It is an amenable number.
2001110111213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001110111213 is an equidigital number, since it uses as much as digits as its factorization.
2001110111213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 2001110111213 its reverse (3121110111002), we get a palindrome (5122220222215).
The spelling of 2001110111213 in words is "two trillion, one billion, one hundred ten million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •