Base | Representation |
---|---|
bin | 1001001100001111110010… |
… | …01101001001001111101001 |
3 | 2122120020201011211001102211 |
4 | 10212013321031021033221 |
5 | 10122123140014201301 |
6 | 110553133210525121 |
7 | 4154161153110442 |
oct | 446077115111751 |
9 | 78506634731384 |
10 | 20212002100201 |
11 | 649295329480a |
12 | 232527a7367a1 |
13 | b37ca3021642 |
14 | 4dc3a23462c9 |
15 | 250b61d43051 |
hex | 1261f93493e9 |
20212002100201 has 2 divisors, whose sum is σ = 20212002100202. Its totient is φ = 20212002100200.
The previous prime is 20212002100193. The next prime is 20212002100211. The reversal of 20212002100201 is 10200120021202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16065386667225 + 4146615432976 = 4008165^2 + 2036324^2 .
It is a cyclic number.
It is not a de Polignac number, because 20212002100201 - 23 = 20212002100193 is a prime.
It is not a weakly prime, because it can be changed into another prime (20212002100211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10106001050100 + 10106001050101.
It is an arithmetic number, because the mean of its divisors is an integer number (10106001050101).
Almost surely, 220212002100201 is an apocalyptic number.
It is an amenable number.
20212002100201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20212002100201 is an equidigital number, since it uses as much as digits as its factorization.
20212002100201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20212002100201 its reverse (10200120021202), we get a palindrome (30412122121403).
The spelling of 20212002100201 in words is "twenty trillion, two hundred twelve billion, two million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •