Base | Representation |
---|---|
bin | 1101001000001… |
… | …11011100111010 |
3 | 21200020020100000 |
4 | 12210013130322 |
5 | 211143143002 |
6 | 14532253430 |
7 | 2505045432 |
oct | 644073472 |
9 | 250206300 |
10 | 110131002 |
11 | 57191063 |
12 | 30a71276 |
13 | 19a7cb97 |
14 | 108ab2c2 |
15 | 9a0661c |
hex | 690773a |
110131002 has 48 divisors (see below), whose sum is σ = 253536192. Its totient is φ = 35808480.
The previous prime is 110131001. The next prime is 110131013. The reversal of 110131002 is 200131011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (110131001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17163 + ... + 22689.
It is an arithmetic number, because the mean of its divisors is an integer number (5282004).
Almost surely, 2110131002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110131002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126768096).
110131002 is an abundant number, since it is smaller than the sum of its proper divisors (143405190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110131002 is an equidigital number, since it uses as much as digits as its factorization.
110131002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5585 (or 5573 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 110131002 is about 10494.3318986966. The cubic root of 110131002 is about 479.3321180011.
Adding to 110131002 its reverse (200131011), we get a palindrome (310262013).
Subtracting 110131002 from its reverse (200131011), we obtain a palindrome (90000009).
The spelling of 110131002 in words is "one hundred ten million, one hundred thirty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •