Base | Representation |
---|---|
bin | 110011010111110010… |
… | …1011110111001110111 |
3 | 101112202101120201210211 |
4 | 1212233211132321313 |
5 | 3301413411133421 |
6 | 122402540530251 |
7 | 10653555464416 |
oct | 1465745367167 |
9 | 345671521724 |
10 | 110320021111 |
11 | 42871859773 |
12 | 19469b50987 |
13 | a5318b7901 |
14 | 54a78c947d |
15 | 2d0a25d9e1 |
hex | 19af95ee77 |
110320021111 has 32 divisors (see below), whose sum is σ = 121060656000. Its totient is φ = 100207607808.
The previous prime is 110320021073. The next prime is 110320021117. The reversal of 110320021111 is 111120023011.
It is a happy number.
It is not a de Polignac number, because 110320021111 - 219 = 110319496823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110320021091 and 110320021100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110320021117) 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, 11452245 + ... + 11461873.
It is an arithmetic number, because the mean of its divisors is an integer number (3783145500).
Almost surely, 2110320021111 is an apocalyptic number.
110320021111 is a deficient number, since it is larger than the sum of its proper divisors (10740634889).
110320021111 is a wasteful number, since it uses less digits than its factorization.
110320021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9963.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110320021111 its reverse (111120023011), we get a palindrome (221440044122).
The spelling of 110320021111 in words is "one hundred ten billion, three hundred twenty million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.201 sec. • engine limits •