Base | Representation |
---|---|
bin | 1101001000000… |
… | …11010011111000 |
3 | 21200012101001210 |
4 | 12210003103320 |
5 | 211142122130 |
6 | 14532043120 |
7 | 2504645121 |
oct | 644032370 |
9 | 250171053 |
10 | 110114040 |
11 | 5717a343 |
12 | 30a634a0 |
13 | 19a7524a |
14 | 108a5048 |
15 | 9a015b0 |
hex | 69034f8 |
110114040 has 32 divisors (see below), whose sum is σ = 330342480. Its totient is φ = 29363712.
The previous prime is 110114033. The next prime is 110114047. The reversal of 110114040 is 40411011.
It is an interprime number because it is at equal distance from previous prime (110114033) and next prime (110114047).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110114047) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 458689 + ... + 458928.
Almost surely, 2110114040 is an apocalyptic number.
110114040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110114040 is an abundant number, since it is smaller than the sum of its proper divisors (220228440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110114040 is a wasteful number, since it uses less digits than its factorization.
110114040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 917631 (or 917627 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 110114040 is about 10493.5237170361. The cubic root of 110114040 is about 479.3075083735.
Adding to 110114040 its reverse (40411011), we get a palindrome (150525051).
It can be divided in two parts, 11011 and 4040, that added together give a palindrome (15051).
The spelling of 110114040 in words is "one hundred ten million, one hundred fourteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •