Base | Representation |
---|---|
bin | 1101001000000… |
… | …01011001111010 |
3 | 21200011222100200 |
4 | 12210001121322 |
5 | 211141344414 |
6 | 14531543030 |
7 | 2504613300 |
oct | 644013172 |
9 | 250158320 |
10 | 110106234 |
11 | 57174497 |
12 | 30a5aa76 |
13 | 19a71824 |
14 | 108a2270 |
15 | 99ee109 |
hex | 690167a |
110106234 has 72 divisors (see below), whose sum is σ = 286535808. Its totient is φ = 30436560.
The previous prime is 110106211. The next prime is 110106287. The reversal of 110106234 is 432601011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 25329 + ... + 29355.
It is an arithmetic number, because the mean of its divisors is an integer number (3979664).
Almost surely, 2110106234 is an apocalyptic number.
110106234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 110106234, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143267904).
110106234 is an abundant number, since it is smaller than the sum of its proper divisors (176429574).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110106234 is a wasteful number, since it uses less digits than its factorization.
110106234 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4080 (or 4070 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 110106234 is about 10493.1517667477. The cubic root of 110106234 is about 479.2961820467.
Adding to 110106234 its reverse (432601011), we get a palindrome (542707245).
The spelling of 110106234 in words is "one hundred ten million, one hundred six thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •