Base | Representation |
---|---|
bin | 1010000110110011011011… |
… | …0100011110100001010101 |
3 | 1110100022000101122022202222 |
4 | 2201230312310132201111 |
5 | 2424024334012332132 |
6 | 35344440554512125 |
7 | 2224546502411153 |
oct | 241546664364125 |
9 | 43308011568688 |
10 | 11112000120917 |
11 | 35a4633419513 |
12 | 12b56b6435645 |
13 | 627b1b10b357 |
14 | 2a5b762463d3 |
15 | 1440ae18a412 |
hex | a1b36d1e855 |
11112000120917 has 2 divisors, whose sum is σ = 11112000120918. Its totient is φ = 11112000120916.
The previous prime is 11112000120911. The next prime is 11112000121003. The reversal of 11112000120917 is 71902100021111.
11112000120917 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9761119269841 + 1350880851076 = 3124279^2 + 1162274^2 .
It is an emirp because it is prime and its reverse (71902100021111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11112000120917 - 26 = 11112000120853 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11112000120911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556000060458 + 5556000060459.
It is an arithmetic number, because the mean of its divisors is an integer number (5556000060459).
Almost surely, 211112000120917 is an apocalyptic number.
It is an amenable number.
11112000120917 is a deficient number, since it is larger than the sum of its proper divisors (1).
11112000120917 is an equidigital number, since it uses as much as digits as its factorization.
11112000120917 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 26.
The spelling of 11112000120917 in words is "eleven trillion, one hundred twelve billion, one hundred twenty thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •