Base | Representation |
---|---|
bin | 110011010001010000… |
… | …1111110111101111001 |
3 | 101112012010110022101221 |
4 | 1212202201332331321 |
5 | 3300441324000212 |
6 | 122325114312041 |
7 | 10645256026156 |
oct | 1464241767571 |
9 | 345163408357 |
10 | 110101000057 |
11 | 4276a164a34 |
12 | 19408728621 |
13 | a4c8400959 |
14 | 548679522d |
15 | 2ce5de8807 |
hex | 19a287ef79 |
110101000057 has 2 divisors, whose sum is σ = 110101000058. Its totient is φ = 110101000056.
The previous prime is 110100999959. The next prime is 110101000067. The reversal of 110101000057 is 750000101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104978592016 + 5122408041 = 324004^2 + 71571^2 .
It is a cyclic number.
It is not a de Polignac number, because 110101000057 - 211 = 110100998009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110101000057.
It is not a weakly prime, because it can be changed into another prime (110101000067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050500028 + 55050500029.
It is an arithmetic number, because the mean of its divisors is an integer number (55050500029).
Almost surely, 2110101000057 is an apocalyptic number.
It is an amenable number.
110101000057 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101000057 is an equidigital number, since it uses as much as digits as its factorization.
110101000057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 35, while the sum is 16.
Adding to 110101000057 its reverse (750000101011), we get a palindrome (860101101068).
The spelling of 110101000057 in words is "one hundred ten billion, one hundred one million, fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •