Base | Representation |
---|---|
bin | 10011110100101111… |
… | …00011001101110001 |
3 | 1000110201112210012221 |
4 | 21322113203031301 |
5 | 133244042202442 |
6 | 4520030521041 |
7 | 524512254025 |
oct | 117227431561 |
9 | 30421483187 |
10 | 10642928497 |
11 | 4571723783 |
12 | 2090366181 |
13 | 1007c66836 |
14 | 72d6c2385 |
15 | 42455a467 |
hex | 27a5e3371 |
10642928497 has 2 divisors, whose sum is σ = 10642928498. Its totient is φ = 10642928496.
The previous prime is 10642928477. The next prime is 10642928507. The reversal of 10642928497 is 79482924601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8745803361 + 1897125136 = 93519^2 + 43556^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10642928497 is a prime.
It is a super-2 number, since 2×106429284972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10642928477) 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, 5321464248 + 5321464249.
It is an arithmetic number, because the mean of its divisors is an integer number (5321464249).
Almost surely, 210642928497 is an apocalyptic number.
It is an amenable number.
10642928497 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642928497 is an equidigital number, since it uses as much as digits as its factorization.
10642928497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 52.
The spelling of 10642928497 in words is "ten billion, six hundred forty-two million, nine hundred twenty-eight thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •