Base | Representation |
---|---|
bin | 110011010010001100… |
… | …0101111000100111110 |
3 | 101112021022000212210212 |
4 | 1212210120233010332 |
5 | 3301022311130420 |
6 | 122332145432422 |
7 | 10646114442302 |
oct | 1464430570476 |
9 | 345238025725 |
10 | 110132130110 |
11 | 42785797452 |
12 | 1941703b712 |
13 | a5019b00c2 |
14 | 548a979d02 |
15 | 2ce89e73c5 |
hex | 19a462f13e |
110132130110 has 8 divisors (see below), whose sum is σ = 198237834216. Its totient is φ = 44052852040.
The previous prime is 110132130091. The next prime is 110132130133. The reversal of 110132130110 is 11031231011.
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×1101321301102 (a number of 23 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 5506606496 + ... + 5506606515.
It is an arithmetic number, because the mean of its divisors is an integer number (24779729277).
Almost surely, 2110132130110 is an apocalyptic number.
110132130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110132130110 is a deficient number, since it is larger than the sum of its proper divisors (88105704106).
110132130110 is a wasteful number, since it uses less digits than its factorization.
110132130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11013213018.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 110132130110 its reverse (11031231011), we get a palindrome (121163361121).
The spelling of 110132130110 in words is "one hundred ten billion, one hundred thirty-two million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •