Base | Representation |
---|---|
bin | 110011001110011010… |
… | …0001100011101100110 |
3 | 101111221110000121211200 |
4 | 1212130310030131212 |
5 | 3300242302020010 |
6 | 122311411143330 |
7 | 10643013004152 |
oct | 1463464143546 |
9 | 344843017750 |
10 | 110005110630 |
11 | 42720020878 |
12 | 193a05a4b46 |
13 | a4b159914c |
14 | 5477b54062 |
15 | 2cdc7a6cc0 |
hex | 199cd0c766 |
110005110630 has 48 divisors (see below), whose sum is σ = 286760148480. Its totient is φ = 29258095104.
The previous prime is 110005110629. The next prime is 110005110647. The reversal of 110005110630 is 36011500011.
It is a super-2 number, since 2×1100051106302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 1561195 + ... + 1630134.
It is an arithmetic number, because the mean of its divisors is an integer number (5974169760).
Almost surely, 2110005110630 is an apocalyptic number.
110005110630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110005110630 is an abundant number, since it is smaller than the sum of its proper divisors (176755037850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110005110630 is a wasteful number, since it uses less digits than its factorization.
110005110630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3191725 (or 3191722 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 110005110630 its reverse (36011500011), we get a palindrome (146016610641).
The spelling of 110005110630 in words is "one hundred ten billion, five million, one hundred ten thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •