Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111111110010111110111001 |
3 | 112102110220020012210202021122 |
4 | 121000231132333302332321 |
5 | 103404220000301400212 |
6 | 1025541145233315025 |
7 | 32112144400645343 |
oct | 3100553677627671 |
9 | 472426205722248 |
10 | 110000001200057 |
11 | 3205a813a8a881 |
12 | 104068a1a05a75 |
13 | 494bc56601757 |
14 | 1d24058174293 |
15 | cab54489d272 |
hex | 640b5eff2fb9 |
110000001200057 has 2 divisors, whose sum is σ = 110000001200058. Its totient is φ = 110000001200056.
The previous prime is 110000001199969. The next prime is 110000001200069. The reversal of 110000001200057 is 750002100000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106851005439376 + 3148995760681 = 10336876^2 + 1774541^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000001200057 - 212 = 110000001195961 is a prime.
It is not a weakly prime, because it can be changed into another prime (110000001200857) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000000600028 + 55000000600029.
It is an arithmetic number, because the mean of its divisors is an integer number (55000000600029).
Almost surely, 2110000001200057 is an apocalyptic number.
It is an amenable number.
110000001200057 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000001200057 is an equidigital number, since it uses as much as digits as its factorization.
110000001200057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70, while the sum is 17.
Adding to 110000001200057 its reverse (750002100000011), we get a palindrome (860002101200068).
The spelling of 110000001200057 in words is "one hundred ten trillion, one million, two hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •