Base | Representation |
---|---|
bin | 10001100110111010001… |
… | …110100110100010010101 |
3 | 11021200020200122222011111 |
4 | 101212322032212202111 |
5 | 124311100102401323 |
6 | 2323512045535021 |
7 | 153264116000143 |
oct | 21467216464225 |
9 | 4250220588144 |
10 | 1210010200213 |
11 | 427187238731 |
12 | 176611b74471 |
13 | 8a146436bb9 |
14 | 427c9b84593 |
15 | 2171d910c0d |
hex | 119ba3a6895 |
1210010200213 has 2 divisors, whose sum is σ = 1210010200214. Its totient is φ = 1210010200212.
The previous prime is 1210010200207. The next prime is 1210010200229. The reversal of 1210010200213 is 3120020100121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 951760238724 + 258249961489 = 975582^2 + 508183^2 .
It is an emirp because it is prime and its reverse (3120020100121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210010200213 - 25 = 1210010200181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1210010200193 and 1210010200202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210010200253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605005100106 + 605005100107.
It is an arithmetic number, because the mean of its divisors is an integer number (605005100107).
Almost surely, 21210010200213 is an apocalyptic number.
It is an amenable number.
1210010200213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210010200213 is an equidigital number, since it uses as much as digits as its factorization.
1210010200213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1210010200213 its reverse (3120020100121), we get a palindrome (4330030300334).
The spelling of 1210010200213 in words is "one trillion, two hundred ten billion, ten million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •