Base | Representation |
---|---|
bin | 110011101001010100… |
… | …1011011101101000100 |
3 | 101121021101110022200111 |
4 | 1213102221123231010 |
5 | 3304120003243030 |
6 | 122541152522404 |
7 | 11004260435200 |
oct | 1472251335504 |
9 | 347241408614 |
10 | 110908259140 |
11 | 430439036a8 |
12 | 195b2b50404 |
13 | a5c6725953 |
14 | 5521a8db00 |
15 | 2d41c0662a |
hex | 19d2a5bb44 |
110908259140 has 72 divisors (see below), whose sum is σ = 271028139480. Its totient is φ = 38012341248.
The previous prime is 110908259047. The next prime is 110908259167. The reversal of 110908259140 is 41952809011.
It can be written as a sum of positive squares in 4 ways, for example, as 25186959616 + 85721299524 = 158704^2 + 292782^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110908259093 and 110908259102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3008902 + ... + 3045538.
It is an arithmetic number, because the mean of its divisors is an integer number (3764279715).
Almost surely, 2110908259140 is an apocalyptic number.
110908259140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110908259140 is an abundant number, since it is smaller than the sum of its proper divisors (160119880340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110908259140 is a wasteful number, since it uses less digits than its factorization.
110908259140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39749 (or 39740 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 40.
The spelling of 110908259140 in words is "one hundred ten billion, nine hundred eight million, two hundred fifty-nine thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •