Base | Representation |
---|---|
bin | 1001010010011010101100… |
… | …1111000000110110111001 |
3 | 1100011020222112122100021211 |
4 | 2110212223033000312321 |
5 | 2314303144041232301 |
6 | 33415155505203121 |
7 | 2102536062441445 |
oct | 224465317006671 |
9 | 40136875570254 |
10 | 10212010102201 |
11 | 3287986526816 |
12 | 118b1a56304a1 |
13 | 590cb073843b |
14 | 27439a2db825 |
15 | 12a987981051 |
hex | 949ab3c0db9 |
10212010102201 has 2 divisors, whose sum is σ = 10212010102202. Its totient is φ = 10212010102200.
The previous prime is 10212010102171. The next prime is 10212010102211. The reversal of 10212010102201 is 10220101021201.
10212010102201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8980300791225 + 1231709310976 = 2996715^2 + 1109824^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212010102201 - 211 = 10212010100153 is a prime.
It is not a weakly prime, because it can be changed into another prime (10212010102211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106005051100 + 5106005051101.
It is an arithmetic number, because the mean of its divisors is an integer number (5106005051101).
Almost surely, 210212010102201 is an apocalyptic number.
It is an amenable number.
10212010102201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212010102201 is an equidigital number, since it uses as much as digits as its factorization.
10212010102201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10212010102201 its reverse (10220101021201), we get a palindrome (20432111123402).
The spelling of 10212010102201 in words is "ten trillion, two hundred twelve billion, ten million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •