Base | Representation |
---|---|
bin | 10110110000000010… |
… | …01010111001010101 |
3 | 1011112020000120210121 |
4 | 23120001022321111 |
5 | 200003303320041 |
6 | 5335554551541 |
7 | 611451210235 |
oct | 133001127125 |
9 | 34466016717 |
10 | 12214120021 |
11 | 51a8609174 |
12 | 244a5985b1 |
13 | 11c8623a6c |
14 | 83c237cc5 |
15 | 4b74687d1 |
hex | 2d804ae55 |
12214120021 has 2 divisors, whose sum is σ = 12214120022. Its totient is φ = 12214120020.
The previous prime is 12214120019. The next prime is 12214120069. The reversal of 12214120021 is 12002141221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12147125796 + 66994225 = 110214^2 + 8185^2 .
It is a cyclic number.
It is not a de Polignac number, because 12214120021 - 21 = 12214120019 is a prime.
Together with 12214120019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12214119977 and 12214120004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12214120091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6107060010 + 6107060011.
It is an arithmetic number, because the mean of its divisors is an integer number (6107060011).
Almost surely, 212214120021 is an apocalyptic number.
It is an amenable number.
12214120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
12214120021 is an equidigital number, since it uses as much as digits as its factorization.
12214120021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12214120021 its reverse (12002141221), we get a palindrome (24216261242).
It can be divided in two parts, 122141200 and 21, that added together give a palindrome (122141221).
The spelling of 12214120021 in words is "twelve billion, two hundred fourteen million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •