Base | Representation |
---|---|
bin | 11001000010011101010110… |
… | …000011010001100010101001 |
3 | 112102220101020211002011222002 |
4 | 121002131112003101202221 |
5 | 103413201441202413001 |
6 | 1030112251422140345 |
7 | 32123625662421635 |
oct | 3102352603214251 |
9 | 472811224064862 |
10 | 110120110201001 |
11 | 320a6749423a1a |
12 | 104260221216b5 |
13 | 495a388261504 |
14 | 1d29badb71dc5 |
15 | cae7241d546b |
hex | 6427560d18a9 |
110120110201001 has 2 divisors, whose sum is σ = 110120110201002. Its totient is φ = 110120110201000.
The previous prime is 110120110200943. The next prime is 110120110201019. The reversal of 110120110201001 is 100102011021011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79683759083776 + 30436351117225 = 8926576^2 + 5516915^2 .
It is an emirp because it is prime and its reverse (100102011021011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110120110201001 - 230 = 110119036459177 is a prime.
It is not a weakly prime, because it can be changed into another prime (110120110201201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55060055100500 + 55060055100501.
It is an arithmetic number, because the mean of its divisors is an integer number (55060055100501).
Almost surely, 2110120110201001 is an apocalyptic number.
It is an amenable number.
110120110201001 is a deficient number, since it is larger than the sum of its proper divisors (1).
110120110201001 is an equidigital number, since it uses as much as digits as its factorization.
110120110201001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110120110201001 its reverse (100102011021011), we get a palindrome (210222121222012).
The spelling of 110120110201001 in words is "one hundred ten trillion, one hundred twenty billion, one hundred ten million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •