Base | Representation |
---|---|
bin | 101101101101001110101010… |
… | …111000001110010001010001 |
3 | 222100202100022211211212222121 |
4 | 231231032222320032101101 |
5 | 202322003403113014141 |
6 | 1551311225330534241 |
7 | 60225142322514505 |
oct | 5555165270162121 |
9 | 870670284755877 |
10 | 201020221219921 |
11 | 59062219324044 |
12 | 1a667095437381 |
13 | 8822182a090bc |
14 | 378d60589a305 |
15 | 1838ee5bbd1d1 |
hex | b6d3aae0e451 |
201020221219921 has 2 divisors, whose sum is σ = 201020221219922. Its totient is φ = 201020221219920.
The previous prime is 201020221219903. The next prime is 201020221220009. The reversal of 201020221219921 is 129912122020102.
It is a happy number.
201020221219921 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143578389056400 + 57441832163521 = 11982420^2 + 7579039^2 .
It is a cyclic number.
It is not a de Polignac number, because 201020221219921 - 215 = 201020221187153 is a prime.
It is not a weakly prime, because it can be changed into another prime (201020221219021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100510110609960 + 100510110609961.
It is an arithmetic number, because the mean of its divisors is an integer number (100510110609961).
Almost surely, 2201020221219921 is an apocalyptic number.
It is an amenable number.
201020221219921 is a deficient number, since it is larger than the sum of its proper divisors (1).
201020221219921 is an equidigital number, since it uses as much as digits as its factorization.
201020221219921 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 34.
The spelling of 201020221219921 in words is "two hundred one trillion, twenty billion, two hundred twenty-one million, two hundred nineteen thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •