Base | Representation |
---|---|
bin | 1010000110001110100101… |
… | …1001001111011100100001 |
3 | 1110022100111012220010221212 |
4 | 2201203221121033130201 |
5 | 2423344110431413212 |
6 | 35340123420555505 |
7 | 2224046444110052 |
oct | 241435131173441 |
9 | 43270435803855 |
10 | 11102111201057 |
11 | 35a0419383678 |
12 | 12b37b66b2b95 |
13 | 626c03443a96 |
14 | 2a54b8b5a729 |
15 | 143bd0e1ee22 |
hex | a18e964f721 |
11102111201057 has 2 divisors, whose sum is σ = 11102111201058. Its totient is φ = 11102111201056.
The previous prime is 11102111201017. The next prime is 11102111201081. The reversal of 11102111201057 is 75010211120111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9304476504976 + 1797634696081 = 3050324^2 + 1340759^2 .
It is a cyclic number.
It is not a de Polignac number, because 11102111201057 - 238 = 10827233294113 is a prime.
It is not a weakly prime, because it can be changed into another prime (11102111201017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551055600528 + 5551055600529.
It is an arithmetic number, because the mean of its divisors is an integer number (5551055600529).
Almost surely, 211102111201057 is an apocalyptic number.
It is an amenable number.
11102111201057 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102111201057 is an equidigital number, since it uses as much as digits as its factorization.
11102111201057 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 11102111201057 its reverse (75010211120111), we get a palindrome (86112322321168).
The spelling of 11102111201057 in words is "eleven trillion, one hundred two billion, one hundred eleven million, two hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •