Base | Representation |
---|---|
bin | 1011001000001000010100… |
… | …11101001100100010100001 |
3 | 10012122011202002110111202001 |
4 | 11210010022131030202201 |
5 | 11201343200123023014 |
6 | 124012415504324001 |
7 | 5103540551164342 |
oct | 544041235144241 |
9 | 105564662414661 |
10 | 24468604111009 |
11 | 7884093142003 |
12 | 28b221a013601 |
13 | 10864c18c5916 |
14 | 608402c140c9 |
15 | 2c6740518974 |
hex | 16410a74c8a1 |
24468604111009 has 2 divisors, whose sum is σ = 24468604111010. Its totient is φ = 24468604111008.
The previous prime is 24468604110971. The next prime is 24468604111033. The reversal of 24468604111009 is 90011140686442.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18598993149025 + 5869610961984 = 4312655^2 + 2422728^2 .
It is a cyclic number.
It is not a de Polignac number, because 24468604111009 - 215 = 24468604078241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 24468604111009.
It is not a weakly prime, because it can be changed into another prime (24468604111109) 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, 12234302055504 + 12234302055505.
It is an arithmetic number, because the mean of its divisors is an integer number (12234302055505).
Almost surely, 224468604111009 is an apocalyptic number.
It is an amenable number.
24468604111009 is a deficient number, since it is larger than the sum of its proper divisors (1).
24468604111009 is an equidigital number, since it uses as much as digits as its factorization.
24468604111009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 46.
The spelling of 24468604111009 in words is "twenty-four trillion, four hundred sixty-eight billion, six hundred four million, one hundred eleven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •