Base | Representation |
---|---|
bin | 1001000111100000011001… |
… | …1010011000111001100001 |
3 | 1022111100010220120000122012 |
4 | 2101320012122120321201 |
5 | 2303220300134444024 |
6 | 33153115253522305 |
7 | 2053151654462654 |
oct | 221700632307141 |
9 | 38440126500565 |
10 | 10024561249889 |
11 | 321543553864a |
12 | 115a9b1343395 |
13 | 579409803794 |
14 | 26929710589b |
15 | 125b6634a50e |
hex | 91e06698e61 |
10024561249889 has 2 divisors, whose sum is σ = 10024561249890. Its totient is φ = 10024561249888.
The previous prime is 10024561249877. The next prime is 10024561249933. The reversal of 10024561249889 is 98894216542001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7091675520400 + 2932885729489 = 2663020^2 + 1712567^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10024561249889 is a prime.
It is a super-2 number, since 2×100245612498892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10024561249289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5012280624944 + 5012280624945.
It is an arithmetic number, because the mean of its divisors is an integer number (5012280624945).
Almost surely, 210024561249889 is an apocalyptic number.
It is an amenable number.
10024561249889 is a deficient number, since it is larger than the sum of its proper divisors (1).
10024561249889 is an equidigital number, since it uses as much as digits as its factorization.
10024561249889 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9953280, while the sum is 59.
The spelling of 10024561249889 in words is "ten trillion, twenty-four billion, five hundred sixty-one million, two hundred forty-nine thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •