Base | Representation |
---|---|
bin | 110011010001100100… |
… | …0100101111011101010 |
3 | 101112012211111111220111 |
4 | 1212203020211323222 |
5 | 3301001421334010 |
6 | 122330115244534 |
7 | 10645441041523 |
oct | 1464310457352 |
9 | 345184444814 |
10 | 110111121130 |
11 | 4277494805a |
12 | 1940bba974a |
13 | a4ca53565a |
14 | 5487c6b84a |
15 | 2ce6c4758a |
hex | 19a3225eea |
110111121130 has 8 divisors (see below), whose sum is σ = 198200018052. Its totient is φ = 44044448448.
The previous prime is 110111121101. The next prime is 110111121149. The reversal of 110111121130 is 31121111011.
It can be written as a sum of positive squares in 2 ways, for example, as 109581522961 + 529598169 = 331031^2 + 23013^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 110111121130.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5505556047 + ... + 5505556066.
Almost surely, 2110111121130 is an apocalyptic number.
110111121130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110111121130 is a deficient number, since it is larger than the sum of its proper divisors (88088896922).
110111121130 is a wasteful number, since it uses less digits than its factorization.
110111121130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11011112120.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 110111121130 its reverse (31121111011), we get a palindrome (141232232141).
The spelling of 110111121130 in words is "one hundred ten billion, one hundred eleven million, one hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •