Base | Representation |
---|---|
bin | 1011000000111011111011… |
… | …10111001100001101000001 |
3 | 10011202112202020220120012101 |
4 | 11200131331313030031001 |
5 | 11133320443120431144 |
6 | 123303101120430401 |
7 | 5046640445501065 |
oct | 540357567141501 |
9 | 104675666816171 |
10 | 24221432202049 |
11 | 7799285032485 |
12 | 2872338778401 |
13 | 10690c071b0a4 |
14 | 5da475c59aa5 |
15 | 2c00c5b376d4 |
hex | 16077ddcc341 |
24221432202049 has 2 divisors, whose sum is σ = 24221432202050. Its totient is φ = 24221432202048.
The previous prime is 24221432201987. The next prime is 24221432202109. The reversal of 24221432202049 is 94020223412242.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22987182305025 + 1234249897024 = 4794495^2 + 1110968^2 .
It is a cyclic number.
It is not a de Polignac number, because 24221432202049 - 217 = 24221432070977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 24221432201999 and 24221432202017.
It is not a weakly prime, because it can be changed into another prime (24221432202449) 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, 12110716101024 + 12110716101025.
It is an arithmetic number, because the mean of its divisors is an integer number (12110716101025).
Almost surely, 224221432202049 is an apocalyptic number.
It is an amenable number.
24221432202049 is a deficient number, since it is larger than the sum of its proper divisors (1).
24221432202049 is an equidigital number, since it uses as much as digits as its factorization.
24221432202049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 37.
The spelling of 24221432202049 in words is "twenty-four trillion, two hundred twenty-one billion, four hundred thirty-two million, two hundred two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •