Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0010100001110000001 |
3 | 101112012202101120000012 |
4 | 1212203010110032001 |
5 | 3301001130000001 |
6 | 122330035234305 |
7 | 10645425362111 |
oct | 1464304241601 |
9 | 345182346005 |
10 | 110110000001 |
11 | 42774251801 |
12 | 1940b748995 |
13 | a4ca232271 |
14 | 5487a59041 |
15 | 2ce6ac52bb |
hex | 19a3114381 |
110110000001 has 2 divisors, whose sum is σ = 110110000002. Its totient is φ = 110110000000.
The previous prime is 110109999941. The next prime is 110110000031. The reversal of 110110000001 is 100000011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109878990400 + 231009601 = 331480^2 + 15199^2 .
It is an emirp because it is prime and its reverse (100000011011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110110000001 - 214 = 110109983617 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 110110000001.
It is not a weakly prime, because it can be changed into another prime (110110000031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055000000 + 55055000001.
It is an arithmetic number, because the mean of its divisors is an integer number (55055000001).
Almost surely, 2110110000001 is an apocalyptic number.
It is an amenable number.
110110000001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110000001 is an equidigital number, since it uses as much as digits as its factorization.
110110000001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 110110000001 its reverse (100000011011), we get a palindrome (210110011012).
The spelling of 110110000001 in words is "one hundred ten billion, one hundred ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •