Base | Representation |
---|---|
bin | 101101101101001110101010… |
… | …111011001101001111001001 |
3 | 222100202100022220022121221222 |
4 | 231231032222323031033021 |
5 | 202322003403313031441 |
6 | 1551311225355411425 |
7 | 60225142332253124 |
oct | 5555165273151711 |
9 | 870670286277858 |
10 | 201020222002121 |
11 | 59062219808795 |
12 | 1a667095753b75 |
13 | 8822182c21142 |
14 | 378d605a213bb |
15 | 1838ee5cc4d4b |
hex | b6d3aaecd3c9 |
201020222002121 has 16 divisors (see below), whose sum is σ = 207965144368128. Its totient is φ = 194104100563200.
The previous prime is 201020222002081. The next prime is 201020222002163. The reversal of 201020222002121 is 121200222020102.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 201020222002121 - 26 = 201020222002057 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201020222002121.
It is not an unprimeable number, because it can be changed into a prime (201020522002121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 506314316 + ... + 506711186.
It is an arithmetic number, because the mean of its divisors is an integer number (12997821523008).
Almost surely, 2201020222002121 is an apocalyptic number.
It is an amenable number.
201020222002121 is a deficient number, since it is larger than the sum of its proper divisors (6944922366007).
201020222002121 is a wasteful number, since it uses less digits than its factorization.
201020222002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 433112.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 201020222002121 its reverse (121200222020102), we get a palindrome (322220444022223).
The spelling of 201020222002121 in words is "two hundred one trillion, twenty billion, two hundred twenty-two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •