Base | Representation |
---|---|
bin | 110011100111001000… |
… | …1111100110101111000 |
3 | 101121002021121002120020 |
4 | 1213032101330311320 |
5 | 3303442224311202 |
6 | 122530014330440 |
7 | 11002410623622 |
oct | 1471621746570 |
9 | 347067532506 |
10 | 110834994552 |
11 | 43006512957 |
12 | 195924b9a20 |
13 | a5b44b3219 |
14 | 551605bc12 |
15 | 2d3a5835bc |
hex | 19ce47cd78 |
110834994552 has 32 divisors (see below), whose sum is σ = 277104266880. Its totient is φ = 36942760800.
The previous prime is 110834994547. The next prime is 110834994577. The reversal of 110834994552 is 255499438011.
It is a junction number, because it is equal to n+sod(n) for n = 110834994495 and 110834994504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 291927 + ... + 553977.
It is an arithmetic number, because the mean of its divisors is an integer number (8659508340).
Almost surely, 2110834994552 is an apocalyptic number.
110834994552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110834994552 is an abundant number, since it is smaller than the sum of its proper divisors (166269272328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110834994552 is a wasteful number, since it uses less digits than its factorization.
110834994552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279683 (or 279679 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 51.
The spelling of 110834994552 in words is "one hundred ten billion, eight hundred thirty-four million, nine hundred ninety-four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •