Base | Representation |
---|---|
bin | 1011101100110010001… |
… | …0100111011010100101 |
3 | 201012211001012010222202 |
4 | 2323030202213122211 |
5 | 11243122012401041 |
6 | 232201014104245 |
7 | 20343653563436 |
oct | 2731442473245 |
9 | 635731163882 |
10 | 201000122021 |
11 | 78275368726 |
12 | 32b5664b085 |
13 | 15c5359ca5a |
14 | 9a2ac6148d |
15 | 536617ba9b |
hex | 2ecc8a76a5 |
201000122021 has 2 divisors, whose sum is σ = 201000122022. Its totient is φ = 201000122020.
The previous prime is 201000122009. The next prime is 201000122033. The reversal of 201000122021 is 120221000102.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (201000122009) and next prime (201000122033).
It can be written as a sum of positive squares in only one way, i.e., 166064400100 + 34935721921 = 407510^2 + 186911^2 .
It is a cyclic number.
It is not a de Polignac number, because 201000122021 - 218 = 200999859877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201000121993 and 201000122011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201000122051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100500061010 + 100500061011.
It is an arithmetic number, because the mean of its divisors is an integer number (100500061011).
Almost surely, 2201000122021 is an apocalyptic number.
It is an amenable number.
201000122021 is a deficient number, since it is larger than the sum of its proper divisors (1).
201000122021 is an equidigital number, since it uses as much as digits as its factorization.
201000122021 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 11.
Adding to 201000122021 its reverse (120221000102), we get a palindrome (321221122123).
The spelling of 201000122021 in words is "two hundred one billion, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •