Base | Representation |
---|---|
bin | 11001000011111010011000… |
… | …000100101000101100101001 |
3 | 112110020221002110022112100012 |
4 | 121003322120010220230221 |
5 | 103421321031014231212 |
6 | 1030230211524221305 |
7 | 32134063254524111 |
oct | 3103723004505451 |
9 | 473227073275305 |
10 | 110220002102057 |
11 | 32135049836751 |
12 | 1044145b83a835 |
13 | 4966917552c83 |
14 | 1d309686d4041 |
15 | cb211dbba922 |
hex | 643e98128b29 |
110220002102057 has 2 divisors, whose sum is σ = 110220002102058. Its totient is φ = 110220002102056.
The previous prime is 110220002101999. The next prime is 110220002102059. The reversal of 110220002102057 is 750201200022011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79173887916841 + 31046114185216 = 8897971^2 + 5571904^2 .
It is a cyclic number.
It is not a de Polignac number, because 110220002102057 - 28 = 110220002101801 is a prime.
Together with 110220002102059, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110220002102059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110001051028 + 55110001051029.
It is an arithmetic number, because the mean of its divisors is an integer number (55110001051029).
Almost surely, 2110220002102057 is an apocalyptic number.
It is an amenable number.
110220002102057 is a deficient number, since it is larger than the sum of its proper divisors (1).
110220002102057 is an equidigital number, since it uses as much as digits as its factorization.
110220002102057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 110220002102057 its reverse (750201200022011), we get a palindrome (860421202124068).
The spelling of 110220002102057 in words is "one hundred ten trillion, two hundred twenty billion, two million, one hundred two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •