Base | Representation |
---|---|
bin | 1010000110001011010001… |
… | …1001001101010111010111 |
3 | 1110022021012020201001112121 |
4 | 2201202310121031113113 |
5 | 2423340300313000322 |
6 | 35335455254200411 |
7 | 2224015426036312 |
oct | 241426431152727 |
9 | 43267166631477 |
10 | 11101222000087 |
11 | 35a000245783a |
12 | 12b35a8953107 |
13 | 626ac115b86b |
14 | 2a5432a11979 |
15 | 143b7cd27ec7 |
hex | a18b464d5d7 |
11101222000087 has 2 divisors, whose sum is σ = 11101222000088. Its totient is φ = 11101222000086.
The previous prime is 11101222000081. The next prime is 11101222000117. The reversal of 11101222000087 is 78000022210111.
It is a happy number.
11101222000087 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 is a cyclic number.
It is not a de Polignac number, because 11101222000087 - 23 = 11101222000079 is a prime.
It is a super-2 number, since 2×111012220000872 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101222000081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550611000043 + 5550611000044.
It is an arithmetic number, because the mean of its divisors is an integer number (5550611000044).
Almost surely, 211101222000087 is an apocalyptic number.
11101222000087 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101222000087 is an equidigital number, since it uses as much as digits as its factorization.
11101222000087 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 25.
Adding to 11101222000087 its reverse (78000022210111), we get a palindrome (89101244210198).
The spelling of 11101222000087 in words is "eleven trillion, one hundred one billion, two hundred twenty-two million, eighty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •