Base | Representation |
---|---|
bin | 10101001101100000… |
… | …11111101010001111 |
3 | 1002101121220022200211 |
4 | 22212300133222033 |
5 | 141310220240124 |
6 | 5121553103251 |
7 | 552124361422 |
oct | 124660375217 |
9 | 32347808624 |
10 | 11387665039 |
11 | 4914049323 |
12 | 2259857b27 |
13 | 10c633a64a |
14 | 7a05839b9 |
15 | 469b17e94 |
hex | 2a6c1fa8f |
11387665039 has 2 divisors, whose sum is σ = 11387665040. Its totient is φ = 11387665038.
The previous prime is 11387665031. The next prime is 11387665187. The reversal of 11387665039 is 93056678311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11387665039 - 23 = 11387665031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11387664983 and 11387665001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11387665031) 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, 5693832519 + 5693832520.
It is an arithmetic number, because the mean of its divisors is an integer number (5693832520).
Almost surely, 211387665039 is an apocalyptic number.
11387665039 is a deficient number, since it is larger than the sum of its proper divisors (1).
11387665039 is an equidigital number, since it uses as much as digits as its factorization.
11387665039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 816480, while the sum is 49.
The spelling of 11387665039 in words is "eleven billion, three hundred eighty-seven million, six hundred sixty-five thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •