Base | Representation |
---|---|
bin | 10100111010110110… |
… | …10010001111101111 |
3 | 1001222201022111201202 |
4 | 22131123102033233 |
5 | 141000131011002 |
6 | 5054241400115 |
7 | 545213601206 |
oct | 123533221757 |
9 | 31881274652 |
10 | 11231110127 |
11 | 484373a2a6 |
12 | 221533903b |
13 | 109ca84cc3 |
14 | 78787023d |
15 | 45aee1502 |
hex | 29d6d23ef |
11231110127 has 2 divisors, whose sum is σ = 11231110128. Its totient is φ = 11231110126.
The previous prime is 11231110123. The next prime is 11231110147. The reversal of 11231110127 is 72101113211.
It is an a-pointer prime, because the next prime (11231110147) can be obtained adding 11231110127 to its sum of digits (20).
It is a weak prime.
It is an emirp because it is prime and its reverse (72101113211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11231110127 - 22 = 11231110123 is a prime.
It is a super-2 number, since 2×112311101272 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11231110099 and 11231110108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11231110123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615555063 + 5615555064.
It is an arithmetic number, because the mean of its divisors is an integer number (5615555064).
Almost surely, 211231110127 is an apocalyptic number.
11231110127 is a deficient number, since it is larger than the sum of its proper divisors (1).
11231110127 is an equidigital number, since it uses as much as digits as its factorization.
11231110127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 11231110127 its reverse (72101113211), we get a palindrome (83332223338).
The spelling of 11231110127 in words is "eleven billion, two hundred thirty-one million, one hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •