Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …011101111101110010000001 |
3 | 112102212102102021101020210100 |
4 | 121002110001131331302001 |
5 | 103413020441401400001 |
6 | 1030103514314353013 |
7 | 32123122645341000 |
oct | 3102240135756201 |
9 | 472772367336710 |
10 | 110110101200001 |
11 | 320a2482621371 |
12 | 104240aa12b769 |
13 | 4959451742106 |
14 | 1d29500748c37 |
15 | cae33a64a586 |
hex | 64250177dc81 |
110110101200001 has 192 divisors, whose sum is σ = 190416905536000. Its totient is φ = 61254905757696.
The previous prime is 110110101199831. The next prime is 110110101200051. The reversal of 110110101200001 is 100002101011011.
It is not a de Polignac number, because 110110101200001 - 221 = 110110099102849 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110110101200051) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 95498786241 + ... + 95498787393.
Almost surely, 2110110101200001 is an apocalyptic number.
It is an amenable number.
110110101200001 is a deficient number, since it is larger than the sum of its proper divisors (80306804335999).
110110101200001 is a wasteful number, since it uses less digits than its factorization.
110110101200001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2965 (or 2948 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110110101200001 its reverse (100002101011011), we get a palindrome (210112202211012).
The spelling of 110110101200001 in words is "one hundred ten trillion, one hundred ten billion, one hundred one million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •