Base | Representation |
---|---|
bin | 11101011010010100001… |
… | …001110001111101001111 |
3 | 21011012212100021020112202 |
4 | 131122110021301331033 |
5 | 231103223234033012 |
6 | 4144253444352115 |
7 | 266010146264306 |
oct | 35322411617517 |
9 | 7135770236482 |
10 | 2021120221007 |
11 | 70a174746498 |
12 | 2878590a563b |
13 | 11878b04c874 |
14 | 6db7385943d |
15 | 37892275cc2 |
hex | 1d694271f4f |
2021120221007 has 2 divisors, whose sum is σ = 2021120221008. Its totient is φ = 2021120221006.
The previous prime is 2021120220983. The next prime is 2021120221031. The reversal of 2021120221007 is 7001220211202.
It is a balanced prime because it is at equal distance from previous prime (2021120220983) and next prime (2021120221031).
It is a cyclic number.
It is not a de Polignac number, because 2021120221007 - 216 = 2021120155471 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2021120221007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021120221907) 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, 1010560110503 + 1010560110504.
It is an arithmetic number, because the mean of its divisors is an integer number (1010560110504).
Almost surely, 22021120221007 is an apocalyptic number.
2021120221007 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021120221007 is an equidigital number, since it uses as much as digits as its factorization.
2021120221007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 2021120221007 its reverse (7001220211202), we get a palindrome (9022340432209).
The spelling of 2021120221007 in words is "two trillion, twenty-one billion, one hundred twenty million, two hundred twenty-one thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •