Base | Representation |
---|---|
bin | 10100101101110110… |
… | …11100011110001011 |
3 | 1001201010012020002121 |
4 | 22112323130132023 |
5 | 140234224200412 |
6 | 5035345112111 |
7 | 542421201556 |
oct | 122673343613 |
9 | 31633166077 |
10 | 11122100107 |
11 | 4798154478 |
12 | 21a4928637 |
13 | 1083308431 |
14 | 7771b569d |
15 | 45165c107 |
hex | 296edc78b |
11122100107 has 2 divisors, whose sum is σ = 11122100108. Its totient is φ = 11122100106.
The previous prime is 11122100071. The next prime is 11122100123. The reversal of 11122100107 is 70100122111.
Together with previous prime (11122100071) it forms an Ormiston pair, because they use the same digits, order apart.
It is an a-pointer prime, because the next prime (11122100123) can be obtained adding 11122100107 to its sum of digits (16).
It is a strong prime.
It is an emirp because it is prime and its reverse (70100122111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11122100107 - 211 = 11122098059 is a prime.
It is a super-2 number, since 2×111221001072 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11122100177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561050053 + 5561050054.
It is an arithmetic number, because the mean of its divisors is an integer number (5561050054).
Almost surely, 211122100107 is an apocalyptic number.
11122100107 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122100107 is an equidigital number, since it uses as much as digits as its factorization.
11122100107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 11122100107 its reverse (70100122111), we get a palindrome (81222222218).
The spelling of 11122100107 in words is "eleven billion, one hundred twenty-two million, one hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •