Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00010010010001111 |
3 | 1001101200100101100102 |
4 | 22033231202102033 |
5 | 140012224412031 |
6 | 5015341521315 |
7 | 536421033224 |
oct | 121755422217 |
9 | 31350311312 |
10 | 11001013391 |
11 | 4735870205 |
12 | 217027323b |
13 | 10641c09a4 |
14 | 76509594b |
15 | 445bde7cb |
hex | 28fb6248f |
11001013391 has 2 divisors, whose sum is σ = 11001013392. Its totient is φ = 11001013390.
The previous prime is 11001013267. The next prime is 11001013417. The reversal of 11001013391 is 19331010011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11001013391 is a prime.
It is a super-2 number, since 2×110010133912 (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 (11001013591) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500506695 + 5500506696.
It is an arithmetic number, because the mean of its divisors is an integer number (5500506696).
Almost surely, 211001013391 is an apocalyptic number.
11001013391 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001013391 is an equidigital number, since it uses as much as digits as its factorization.
11001013391 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81, while the sum is 20.
The spelling of 11001013391 in words is "eleven billion, one million, thirteen thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •