Base | Representation |
---|---|
bin | 1010111011101110001010… |
… | …0101111110011010110101 |
3 | 1120120012121112021100102011 |
4 | 2232323202211332122311 |
5 | 3033423223221200041 |
6 | 41322232031044221 |
7 | 2350332363626104 |
oct | 256734245763265 |
9 | 46505545240364 |
10 | 12021120100021 |
11 | 39151459a761a |
12 | 1421934970671 |
13 | 692782164ca6 |
14 | 2d7b7a95603b |
15 | 15ca6c192e81 |
hex | aeee297e6b5 |
12021120100021 has 2 divisors, whose sum is σ = 12021120100022. Its totient is φ = 12021120100020.
The previous prime is 12021120100009. The next prime is 12021120100051. The reversal of 12021120100021 is 12000102112021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10471119999921 + 1550000100100 = 3235911^2 + 1244990^2 .
It is a cyclic number.
It is not a de Polignac number, because 12021120100021 - 231 = 12018972616373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12021120099974 and 12021120100010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12021120100051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010560050010 + 6010560050011.
It is an arithmetic number, because the mean of its divisors is an integer number (6010560050011).
Almost surely, 212021120100021 is an apocalyptic number.
It is an amenable number.
12021120100021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12021120100021 is an equidigital number, since it uses as much as digits as its factorization.
12021120100021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12021120100021 its reverse (12000102112021), we get a palindrome (24021222212042).
The spelling of 12021120100021 in words is "twelve trillion, twenty-one billion, one hundred twenty million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •