Base | Representation |
---|---|
bin | 1010000111011001000011… |
… | …0101010000110011101111 |
3 | 1110101021002021202001120202 |
4 | 2201312100311100303233 |
5 | 2424211030123222202 |
6 | 35353231114504115 |
7 | 2225355003641546 |
oct | 241662065206357 |
9 | 43337067661522 |
10 | 11122100210927 |
11 | 35a8946686642 |
12 | 12b7654a3503b |
13 | 628a6a771284 |
14 | 2a64537c115d |
15 | 1444a0c19802 |
hex | a1d90d50cef |
11122100210927 has 2 divisors, whose sum is σ = 11122100210928. Its totient is φ = 11122100210926.
The previous prime is 11122100210887. The next prime is 11122100210939. The reversal of 11122100210927 is 72901200122111.
11122100210927 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 11122100210927 - 26 = 11122100210863 is a prime.
It is a super-2 number, since 2×111221002109272 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11122100210927.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11122100210227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561050105463 + 5561050105464.
It is an arithmetic number, because the mean of its divisors is an integer number (5561050105464).
Almost surely, 211122100210927 is an apocalyptic number.
11122100210927 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122100210927 is an equidigital number, since it uses as much as digits as its factorization.
11122100210927 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 29.
The spelling of 11122100210927 in words is "eleven trillion, one hundred twenty-two billion, one hundred million, two hundred ten thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •