Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00011111011010101 |
3 | 1001101200100201120112 |
4 | 22033231203323111 |
5 | 140012230120432 |
6 | 5015342012405 |
7 | 536421061643 |
oct | 121755437325 |
9 | 31350321515 |
10 | 11001020117 |
11 | 473587526a |
12 | 2170277105 |
13 | 10641c3a79 |
14 | 765098193 |
15 | 445be17b2 |
hex | 28fb63ed5 |
11001020117 has 2 divisors, whose sum is σ = 11001020118. Its totient is φ = 11001020116.
The previous prime is 11001020089. The next prime is 11001020119. The reversal of 11001020117 is 71102010011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10974867121 + 26152996 = 104761^2 + 5114^2 .
It is an emirp because it is prime and its reverse (71102010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001020117 - 210 = 11001019093 is a prime.
It is a super-2 number, since 2×110010201172 (a number of 21 digits) contains 22 as substring.
Together with 11001020119, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001020119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500510058 + 5500510059.
It is an arithmetic number, because the mean of its divisors is an integer number (5500510059).
Almost surely, 211001020117 is an apocalyptic number.
It is an amenable number.
11001020117 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001020117 is an equidigital number, since it uses as much as digits as its factorization.
11001020117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 11001020117 its reverse (71102010011), we get a palindrome (82103030128).
The spelling of 11001020117 in words is "eleven billion, one million, twenty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •