Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1011100111000100101 |
3 | 101111222111021011222000 |
4 | 1212131231130320211 |
5 | 3300310122320401 |
6 | 122313104555513 |
7 | 10643254406433 |
oct | 1463555347045 |
9 | 344874234860 |
10 | 110020120101 |
11 | 427285426a1 |
12 | 193a5622b99 |
13 | a4b4722ba8 |
14 | 5479b3dd53 |
15 | 2cddc6e186 |
hex | 199db5ce25 |
110020120101 has 32 divisors (see below), whose sum is σ = 163683676800. Its totient is φ = 73036131840.
The previous prime is 110020120097. The next prime is 110020120127. The reversal of 110020120101 is 101021020011.
It is a happy number.
It is not a de Polignac number, because 110020120101 - 22 = 110020120097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020320101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24408690 + ... + 24413196.
It is an arithmetic number, because the mean of its divisors is an integer number (5115114900).
Almost surely, 2110020120101 is an apocalyptic number.
It is an amenable number.
110020120101 is a deficient number, since it is larger than the sum of its proper divisors (53663556699).
110020120101 is a wasteful number, since it uses less digits than its factorization.
110020120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8146 (or 8140 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 110020120101 its reverse (101021020011), we get a palindrome (211041140112).
The spelling of 110020120101 in words is "one hundred ten billion, twenty million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •