Base | Representation |
---|---|
bin | 1001100110100000000111… |
… | …01000010010111010011001 |
3 | 2202202111020100000210101022 |
4 | 10303100003220102322121 |
5 | 10231413204222401014 |
6 | 112523405354532225 |
7 | 4306305402554615 |
oct | 463200350227231 |
9 | 82674210023338 |
10 | 21114120122009 |
11 | 68004a2401752 |
12 | 2450084137075 |
13 | ba208c538495 |
14 | 52dd00b4a345 |
15 | 269360296a8e |
hex | 133403a12e99 |
21114120122009 has 2 divisors, whose sum is σ = 21114120122010. Its totient is φ = 21114120122008.
The previous prime is 21114120122003. The next prime is 21114120122159. The reversal of 21114120122009 is 90022102141112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17043248952409 + 4070871169600 = 4128347^2 + 2017640^2 .
It is a cyclic number.
It is not a de Polignac number, because 21114120122009 - 28 = 21114120121753 is a prime.
It is not a weakly prime, because it can be changed into another prime (21114120122003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10557060061004 + 10557060061005.
It is an arithmetic number, because the mean of its divisors is an integer number (10557060061005).
Almost surely, 221114120122009 is an apocalyptic number.
It is an amenable number.
21114120122009 is a deficient number, since it is larger than the sum of its proper divisors (1).
21114120122009 is an equidigital number, since it uses as much as digits as its factorization.
21114120122009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 21114120122009 in words is "twenty-one trillion, one hundred fourteen billion, one hundred twenty million, one hundred twenty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •