Base | Representation |
---|---|
bin | 10100100000111011… |
… | …10010010110110011 |
3 | 1001102120011000011021 |
4 | 22100131302112303 |
5 | 140023444142011 |
6 | 5020513000311 |
7 | 536633404063 |
oct | 122035622663 |
9 | 31376130137 |
10 | 11013662131 |
11 | 4741a1a40a |
12 | 2174553097 |
13 | 10669cc054 |
14 | 766a293a3 |
15 | 446d8c471 |
hex | 2907725b3 |
11013662131 has 2 divisors, whose sum is σ = 11013662132. Its totient is φ = 11013662130.
The previous prime is 11013662117. The next prime is 11013662141. The reversal of 11013662131 is 13126631011.
11013662131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11013662131 - 219 = 11013137843 is a prime.
It is a super-2 number, since 2×110136621312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11013662096 and 11013662105.
It is not a weakly prime, because it can be changed into another prime (11013662141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506831065 + 5506831066.
It is an arithmetic number, because the mean of its divisors is an integer number (5506831066).
Almost surely, 211013662131 is an apocalyptic number.
11013662131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013662131 is an equidigital number, since it uses as much as digits as its factorization.
11013662131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 11013662131 in words is "eleven billion, thirteen million, six hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •