Base | Representation |
---|---|
bin | 10011000101001110… |
… | …10111001110010001 |
3 | 222102221200111000101 |
4 | 21202213113032101 |
5 | 131440032423442 |
6 | 4412313252401 |
7 | 511603065103 |
oct | 114247271621 |
9 | 28387614011 |
10 | 10244420497 |
11 | 4387787823 |
12 | 1b9aa04101 |
13 | c7352839c |
14 | 6d27c9573 |
15 | 3ee58dcb7 |
hex | 2629d7391 |
10244420497 has 2 divisors, whose sum is σ = 10244420498. Its totient is φ = 10244420496.
The previous prime is 10244420443. The next prime is 10244420503. The reversal of 10244420497 is 79402444201.
It is a happy number.
10244420497 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7866980416 + 2377440081 = 88696^2 + 48759^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10244420497 is a prime.
It is not a weakly prime, because it can be changed into another prime (10244429497) 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, 5122210248 + 5122210249.
It is an arithmetic number, because the mean of its divisors is an integer number (5122210249).
Almost surely, 210244420497 is an apocalyptic number.
It is an amenable number.
10244420497 is a deficient number, since it is larger than the sum of its proper divisors (1).
10244420497 is an equidigital number, since it uses as much as digits as its factorization.
10244420497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64512, while the sum is 37.
Adding to 10244420497 its reverse (79402444201), we get a palindrome (89646864698).
The spelling of 10244420497 in words is "ten billion, two hundred forty-four million, four hundred twenty thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •