Base | Representation |
---|---|
bin | 1101000111010… |
… | …10011010010111 |
3 | 21200000012011120 |
4 | 12203222122113 |
5 | 211130341210 |
6 | 14525535023 |
7 | 2504041566 |
oct | 643523227 |
9 | 250005146 |
10 | 110012055 |
11 | 5710a75a |
12 | 30a14473 |
13 | 19a3a9ba |
14 | 10879bdd |
15 | 99d1270 |
hex | 68ea697 |
110012055 has 8 divisors (see below), whose sum is σ = 176019312. Its totient is φ = 58673088.
The previous prime is 110012039. The next prime is 110012069. The reversal of 110012055 is 550210011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110012055 - 24 = 110012039 is a prime.
It is a super-3 number, since 3×1100120553 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 7334137 = 110012055 / (1 + 1 + 0 + 0 + 1 + 2 + 0 + 5 + 5).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3667054 + ... + 3667083.
It is an arithmetic number, because the mean of its divisors is an integer number (22002414).
Almost surely, 2110012055 is an apocalyptic number.
110012055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
110012055 is a deficient number, since it is larger than the sum of its proper divisors (66007257).
110012055 is an equidigital number, since it uses as much as digits as its factorization.
110012055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7334145.
The product of its (nonzero) digits is 50, while the sum is 15.
The square root of 110012055 is about 10488.6631655326. The cubic root of 110012055 is about 479.1594882689.
Adding to 110012055 its reverse (550210011), we get a palindrome (660222066).
The spelling of 110012055 in words is "one hundred ten million, twelve thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •