Base | Representation |
---|---|
bin | 1101001000000… |
… | …00110111100000 |
3 | 21200011212100010 |
4 | 12210000313200 |
5 | 211141312112 |
6 | 14531524520 |
7 | 2504604003 |
oct | 644006740 |
9 | 250155303 |
10 | 110104032 |
11 | 57172875 |
12 | 30a59740 |
13 | 19a7081c |
14 | 108a153a |
15 | 99ed63c |
hex | 6900de0 |
110104032 has 24 divisors (see below), whose sum is σ = 289023336. Its totient is φ = 36701312.
The previous prime is 110104003. The next prime is 110104063. The reversal of 110104032 is 230401011.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 110103999 and 110104017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 573363 + ... + 573554.
It is an arithmetic number, because the mean of its divisors is an integer number (12042639).
Almost surely, 2110104032 is an apocalyptic number.
110104032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110104032 is an abundant number, since it is smaller than the sum of its proper divisors (178919304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110104032 is a wasteful number, since it uses less digits than its factorization.
110104032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1146930 (or 1146922 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 110104032 is about 10493.0468406464. The cubic root of 110104032 is about 479.2929868984.
Adding to 110104032 its reverse (230401011), we get a palindrome (340505043).
The spelling of 110104032 in words is "one hundred ten million, one hundred four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •