Base | Representation |
---|---|
bin | 10101010000110001… |
… | …10100101000100111 |
3 | 1002110112100210022121 |
4 | 22220120310220213 |
5 | 141334220421202 |
6 | 5124411210411 |
7 | 552606005662 |
oct | 125030645047 |
9 | 32415323277 |
10 | 11415013927 |
11 | 4928528a09 |
12 | 2266a46a07 |
13 | 10cbbc4a15 |
14 | 7a40626d9 |
15 | 46c21b537 |
hex | 2a8634a27 |
11415013927 has 2 divisors, whose sum is σ = 11415013928. Its totient is φ = 11415013926.
The previous prime is 11415013903. The next prime is 11415013931. The reversal of 11415013927 is 72931051411.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11415013927 is a prime.
It is a super-2 number, since 2×114150139272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11415013892 and 11415013901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11415013937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5707506963 + 5707506964.
It is an arithmetic number, because the mean of its divisors is an integer number (5707506964).
Almost surely, 211415013927 is an apocalyptic number.
11415013927 is a deficient number, since it is larger than the sum of its proper divisors (1).
11415013927 is an equidigital number, since it uses as much as digits as its factorization.
11415013927 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 34.
The spelling of 11415013927 in words is "eleven billion, four hundred fifteen million, thirteen thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •