Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …0101001010011010011101 |
3 | 1110022011120201122211020212 |
4 | 2201201320011022122131 |
5 | 2423331212242042112 |
6 | 35335211030022205 |
7 | 2223651361113605 |
oct | 241417005123235 |
9 | 43264521584225 |
10 | 11100210112157 |
11 | 359a633254421 |
12 | 12b3365aa7965 |
13 | 62698c61b6ca |
14 | 2a537848bc05 |
15 | 143b1e099522 |
hex | a187814a69d |
11100210112157 has 2 divisors, whose sum is σ = 11100210112158. Its totient is φ = 11100210112156.
The previous prime is 11100210112129. The next prime is 11100210112181. The reversal of 11100210112157 is 75121101200111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7491201844036 + 3609008268121 = 2737006^2 + 1899739^2 .
It is a cyclic number.
It is not a de Polignac number, because 11100210112157 - 212 = 11100210108061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11100210112127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550105056078 + 5550105056079.
It is an arithmetic number, because the mean of its divisors is an integer number (5550105056079).
Almost surely, 211100210112157 is an apocalyptic number.
It is an amenable number.
11100210112157 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100210112157 is an equidigital number, since it uses as much as digits as its factorization.
11100210112157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 23.
Adding to 11100210112157 its reverse (75121101200111), we get a palindrome (86221311312268).
The spelling of 11100210112157 in words is "eleven trillion, one hundred billion, two hundred ten million, one hundred twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •