Base | Representation |
---|---|
bin | 10000001001111101000… |
… | …100111111010010001101 |
3 | 10221010121202012120200011 |
4 | 100021331010333102031 |
5 | 121142142201202112 |
6 | 2210004023233221 |
7 | 143131535325322 |
oct | 20117504772215 |
9 | 3833552176604 |
10 | 1110200022157 |
11 | 398918a73676 |
12 | 15b1b78a8811 |
13 | 808cb059b45 |
14 | 3ba3c016b49 |
15 | 1dd2b1beaa7 |
hex | 1027d13f48d |
1110200022157 has 2 divisors, whose sum is σ = 1110200022158. Its totient is φ = 1110200022156.
The previous prime is 1110200022131. The next prime is 1110200022179. The reversal of 1110200022157 is 7512200020111.
It is an a-pointer prime, because the next prime (1110200022179) can be obtained adding 1110200022157 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 861529250596 + 248670771561 = 928186^2 + 498669^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110200022157 - 215 = 1110199989389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110200022857) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555100011078 + 555100011079.
It is an arithmetic number, because the mean of its divisors is an integer number (555100011079).
Almost surely, 21110200022157 is an apocalyptic number.
It is an amenable number.
1110200022157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110200022157 is an equidigital number, since it uses as much as digits as its factorization.
1110200022157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 280, while the sum is 22.
Adding to 1110200022157 its reverse (7512200020111), we get a palindrome (8622400042268).
The spelling of 1110200022157 in words is "one trillion, one hundred ten billion, two hundred million, twenty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •