Base | Representation |
---|---|
bin | 110011001110101111… |
… | …1010110011111000000 |
3 | 101111222020022101200122 |
4 | 1212131133112133000 |
5 | 3300303201030442 |
6 | 122312453435412 |
7 | 10643211113315 |
oct | 1463537263700 |
9 | 344866271618 |
10 | 110016423872 |
11 | 42726448663 |
12 | 193a433bb68 |
13 | a4b3a2a684 |
14 | 547945ad0c |
15 | 2cdd78ddd2 |
hex | 199d7d67c0 |
110016423872 has 56 divisors (see below), whose sum is σ = 223034230080. Its totient is φ = 53819617280.
The previous prime is 110016423841. The next prime is 110016423877. The reversal of 110016423872 is 278324610011.
It is a super-2 number, since 2×1100164238722 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110016423877) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14702372 + ... + 14709852.
Almost surely, 2110016423872 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110016423872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111517115040).
110016423872 is an abundant number, since it is smaller than the sum of its proper divisors (113017806208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110016423872 is an equidigital number, since it uses as much as digits as its factorization.
110016423872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12429 (or 12419 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 35.
The spelling of 110016423872 in words is "one hundred ten billion, sixteen million, four hundred twenty-three thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •