Base | Representation |
---|---|
bin | 1001010010010110111111… |
… | …0000010111010100100001 |
3 | 1100011011101222221021021112 |
4 | 2110211233300113110201 |
5 | 2314244123111241001 |
6 | 33414512501033105 |
7 | 2102502254505536 |
oct | 224455760272441 |
9 | 40134358837245 |
10 | 10211012212001 |
11 | 3287514214077 |
12 | 118ab673b5795 |
13 | 590b81a89673 |
14 | 27430397cd8d |
15 | 12a92a069cbb |
hex | 9496fc17521 |
10211012212001 has 2 divisors, whose sum is σ = 10211012212002. Its totient is φ = 10211012212000.
The previous prime is 10211012211931. The next prime is 10211012212003. The reversal of 10211012212001 is 10021221011201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10210427781376 + 584430625 = 3195376^2 + 24175^2 .
It is an emirp because it is prime and its reverse (10021221011201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10211012212001 - 210 = 10211012210977 is a prime.
Together with 10211012212003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10211012212003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105506106000 + 5105506106001.
It is an arithmetic number, because the mean of its divisors is an integer number (5105506106001).
Almost surely, 210211012212001 is an apocalyptic number.
It is an amenable number.
10211012212001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211012212001 is an equidigital number, since it uses as much as digits as its factorization.
10211012212001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10211012212001 its reverse (10021221011201), we get a palindrome (20232233223202).
The spelling of 10211012212001 in words is "ten trillion, two hundred eleven billion, twelve million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •