Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0100101111100010001 |
3 | 101112012001210011000101 |
4 | 1212202132211330101 |
5 | 3300441112023441 |
6 | 122325043252401 |
7 | 10645245334420 |
oct | 1464236457421 |
9 | 345161704011 |
10 | 110100111121 |
11 | 42769708080 |
12 | 1940837a101 |
13 | a4c817c160 |
14 | 54866032b7 |
15 | 2ce5cc0231 |
hex | 19a27a5f11 |
110100111121 has 32 divisors (see below), whose sum is σ = 148592924928. Its totient is φ = 78782423040.
The previous prime is 110100111103. The next prime is 110100111133. The reversal of 110100111121 is 121111001011.
It is a cyclic number.
It is not a de Polignac number, because 110100111121 - 25 = 110100111089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100111098 and 110100111107.
It is not an unprimeable number, because it can be changed into a prime (110100111181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 91756 + ... + 478141.
It is an arithmetic number, because the mean of its divisors is an integer number (4643528904).
Almost surely, 2110100111121 is an apocalyptic number.
110100111121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110100111121 is a deficient number, since it is larger than the sum of its proper divisors (38492813807).
110100111121 is a wasteful number, since it uses less digits than its factorization.
110100111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570121.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110100111121 its reverse (121111001011), we get a palindrome (231211112132).
The spelling of 110100111121 in words is "one hundred ten billion, one hundred million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •