Base | Representation |
---|---|
bin | 10011110001100011… |
… | …010000010100011111 |
3 | 2000210201112200211122 |
4 | 103301203100110133 |
5 | 321440444421002 |
6 | 13430512241155 |
7 | 1351105410332 |
oct | 236143202437 |
9 | 60721480748 |
10 | 21232420127 |
11 | 9006169556 |
12 | 41468401bb |
13 | 2004b10809 |
14 | 1055c54619 |
15 | 84405c6a2 |
hex | 4f18d051f |
21232420127 has 2 divisors, whose sum is σ = 21232420128. Its totient is φ = 21232420126.
The previous prime is 21232420117. The next prime is 21232420129. The reversal of 21232420127 is 72102423212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 21232420127 - 218 = 21232157983 is a prime.
It is a super-2 number, since 2×212324201272 (a number of 21 digits) contains 22 as substring.
Together with 21232420129, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 21232420096 and 21232420105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21232420129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10616210063 + 10616210064.
It is an arithmetic number, because the mean of its divisors is an integer number (10616210064).
Almost surely, 221232420127 is an apocalyptic number.
21232420127 is a deficient number, since it is larger than the sum of its proper divisors (1).
21232420127 is an equidigital number, since it uses as much as digits as its factorization.
21232420127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 26.
Adding to 21232420127 its reverse (72102423212), we get a palindrome (93334843339).
The spelling of 21232420127 in words is "twenty-one billion, two hundred thirty-two million, four hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •