Base | Representation |
---|---|
bin | 10101000011101111… |
… | …00001111001010111 |
3 | 1002011220112011100111 |
4 | 22201313201321113 |
5 | 141123214420002 |
6 | 5105502423451 |
7 | 550110132241 |
oct | 124167417127 |
9 | 32156464314 |
10 | 11305623127 |
11 | 4881802a97 |
12 | 2236291b87 |
13 | 10b2343a36 |
14 | 793709091 |
15 | 46280e3d7 |
hex | 2a1de1e57 |
11305623127 has 2 divisors, whose sum is σ = 11305623128. Its totient is φ = 11305623126.
The previous prime is 11305623061. The next prime is 11305623139. The reversal of 11305623127 is 72132650311.
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-11305623127 is a prime.
It is a super-2 number, since 2×113056231272 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11305633127) 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, 5652811563 + 5652811564.
It is an arithmetic number, because the mean of its divisors is an integer number (5652811564).
Almost surely, 211305623127 is an apocalyptic number.
11305623127 is a deficient number, since it is larger than the sum of its proper divisors (1).
11305623127 is an equidigital number, since it uses as much as digits as its factorization.
11305623127 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 31.
The spelling of 11305623127 in words is "eleven billion, three hundred five million, six hundred twenty-three thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •