Base | Representation |
---|---|
bin | 110011001111001011… |
… | …1011010111010111110 |
3 | 101112000020222010212211 |
4 | 1212132113122322332 |
5 | 3300320431401420 |
6 | 122314140451034 |
7 | 10643450051320 |
oct | 1463627327276 |
9 | 345006863784 |
10 | 110031122110 |
11 | 42733777668 |
12 | 193a9249a7a |
13 | a4b6aa5860 |
14 | 547b3a5610 |
15 | 2cdebe3e5a |
hex | 199e5daebe |
110031122110 has 128 divisors (see below), whose sum is σ = 259685637120. Its totient is φ = 32592347136.
The previous prime is 110031122101. The next prime is 110031122111. The reversal of 110031122110 is 11221130011.
It is a happy number.
110031122110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110031122111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1396734 + ... + 1473406.
It is an arithmetic number, because the mean of its divisors is an integer number (2028794040).
Almost surely, 2110031122110 is an apocalyptic number.
110031122110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110031122110 is an abundant number, since it is smaller than the sum of its proper divisors (149654515010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110031122110 is a wasteful number, since it uses less digits than its factorization.
110031122110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76802.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110031122110 its reverse (11221130011), we get a palindrome (121252252121).
The spelling of 110031122110 in words is "one hundred ten billion, thirty-one million, one hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •