Base | Representation |
---|---|
bin | 1001010010011011011111… |
… | …1000001001010010000001 |
3 | 1100011021112022202121010201 |
4 | 2110212313320021102001 |
5 | 2314304112341224301 |
6 | 33415232523325201 |
7 | 2102544246361153 |
oct | 224466770112201 |
9 | 40137468677121 |
10 | 10212222211201 |
11 | 3287a8522a40a |
12 | 118b244680801 |
13 | 59101567221a |
14 | 2743ba552ad3 |
15 | 12a99b3cd201 |
hex | 949b7e09481 |
10212222211201 has 2 divisors, whose sum is σ = 10212222211202. Its totient is φ = 10212222211200.
The previous prime is 10212222211193. The next prime is 10212222211223. The reversal of 10212222211201 is 10211222221201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6894720608400 + 3317501602801 = 2625780^2 + 1821401^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212222211201 - 23 = 10212222211193 is a prime.
It is not a weakly prime, because it can be changed into another prime (10212222211501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106111105600 + 5106111105601.
It is an arithmetic number, because the mean of its divisors is an integer number (5106111105601).
Almost surely, 210212222211201 is an apocalyptic number.
It is an amenable number.
10212222211201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212222211201 is an equidigital number, since it uses as much as digits as its factorization.
10212222211201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 10212222211201 its reverse (10211222221201), we get a palindrome (20423444432402).
The spelling of 10212222211201 in words is "ten trillion, two hundred twelve billion, two hundred twenty-two million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •