Base | Representation |
---|---|
bin | 1101000111011… |
… | …10110100011110 |
3 | 21200001002221021 |
4 | 12203232310132 |
5 | 211131430420 |
6 | 14530154354 |
7 | 2504145331 |
oct | 643566436 |
9 | 250032837 |
10 | 110030110 |
11 | 57122283 |
12 | 30a229ba |
13 | 19a45c98 |
14 | 10882618 |
15 | 99d67aa |
hex | 68eed1e |
110030110 has 8 divisors (see below), whose sum is σ = 198054216. Its totient is φ = 44012040.
The previous prime is 110030087. The next prime is 110030113. The reversal of 110030110 is 11030011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100301102 = 24213250213224200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110030093 and 110030102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110030113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5501496 + ... + 5501515.
It is an arithmetic number, because the mean of its divisors is an integer number (24756777).
Almost surely, 2110030110 is an apocalyptic number.
110030110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110030110 is a deficient number, since it is larger than the sum of its proper divisors (88024106).
110030110 is a wasteful number, since it uses less digits than its factorization.
110030110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11003018.
The product of its (nonzero) digits is 3, while the sum is 7.
The square root of 110030110 is about 10489.5238214134. The cubic root of 110030110 is about 479.1856997943.
Adding to 110030110 its reverse (11030011), we get a palindrome (121060121).
Subtracting from 110030110 its reverse (11030011), we obtain a palindrome (99000099).
The spelling of 110030110 in words is "one hundred ten million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •