Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0110001100010100101 |
3 | 101112012202121122202100 |
4 | 1212203010301202211 |
5 | 3301001142320401 |
6 | 122330042002313 |
7 | 10645426402212 |
oct | 1464304614245 |
9 | 345182548670 |
10 | 110110120101 |
11 | 42774323a63 |
12 | 1940b7a6399 |
13 | a4ca274b27 |
14 | 5487a8ab09 |
15 | 2ce6aeab86 |
hex | 19a31318a5 |
110110120101 has 48 divisors (see below), whose sum is σ = 169864568640. Its totient is φ = 68534138880.
The previous prime is 110110120091. The next prime is 110110120103. The reversal of 110110120101 is 101021011011.
It is not a de Polignac number, because 110110120101 - 26 = 110110120037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110110120103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3515731 + ... + 3546911.
It is an arithmetic number, because the mean of its divisors is an integer number (3538845180).
Almost surely, 2110110120101 is an apocalyptic number.
It is an amenable number.
110110120101 is a deficient number, since it is larger than the sum of its proper divisors (59754448539).
110110120101 is a wasteful number, since it uses less digits than its factorization.
110110120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31506 (or 31503 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110110120101 its reverse (101021011011), we get a palindrome (211131131112).
The spelling of 110110120101 in words is "one hundred ten billion, one hundred ten million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •