Base | Representation |
---|---|
bin | 10011110011011000… |
… | …10001111001101011 |
3 | 1000102221012111101202 |
4 | 21321230101321223 |
5 | 133233141213022 |
6 | 4514543434415 |
7 | 524313661523 |
oct | 117154217153 |
9 | 30387174352 |
10 | 10631585387 |
11 | 4566286505 |
12 | 20885b5a0b |
13 | 10057c4837 |
14 | 72bdac683 |
15 | 423569592 |
hex | 279b11e6b |
10631585387 has 2 divisors, whose sum is σ = 10631585388. Its totient is φ = 10631585386.
The previous prime is 10631585359. The next prime is 10631585411. The reversal of 10631585387 is 78358513601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10631585387 - 212 = 10631581291 is a prime.
It is a super-2 number, since 2×106315853872 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10631585357) 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, 5315792693 + 5315792694.
It is an arithmetic number, because the mean of its divisors is an integer number (5315792694).
Almost surely, 210631585387 is an apocalyptic number.
10631585387 is a deficient number, since it is larger than the sum of its proper divisors (1).
10631585387 is an equidigital number, since it uses as much as digits as its factorization.
10631585387 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 604800, while the sum is 47.
The spelling of 10631585387 in words is "ten billion, six hundred thirty-one million, five hundred eighty-five thousand, three hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •