Base | Representation |
---|---|
bin | 100011001111000011010… |
… | …111001011001111001101 |
3 | 22120110220122022221112121 |
4 | 203033003113023033031 |
5 | 304132403110020414 |
6 | 5052203345532541 |
7 | 336636111166033 |
oct | 43170327131715 |
9 | 8513818287477 |
10 | 2421344220109 |
11 | 853982762711 |
12 | 331333344151 |
13 | 147440bc8949 |
14 | 8529d68a553 |
15 | 42eb8669724 |
hex | 233c35cb3cd |
2421344220109 has 2 divisors, whose sum is σ = 2421344220110. Its totient is φ = 2421344220108.
The previous prime is 2421344220103. The next prime is 2421344220179. The reversal of 2421344220109 is 9010224431242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2410635074884 + 10709145225 = 1552622^2 + 103485^2 .
It is a cyclic number.
It is not a de Polignac number, because 2421344220109 - 27 = 2421344219981 is a prime.
It is a super-2 number, since 2×24213442201092 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2421344220103) 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, 1210672110054 + 1210672110055.
It is an arithmetic number, because the mean of its divisors is an integer number (1210672110055).
Almost surely, 22421344220109 is an apocalyptic number.
It is an amenable number.
2421344220109 is a deficient number, since it is larger than the sum of its proper divisors (1).
2421344220109 is an equidigital number, since it uses as much as digits as its factorization.
2421344220109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 34.
The spelling of 2421344220109 in words is "two trillion, four hundred twenty-one billion, three hundred forty-four million, two hundred twenty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •