Base | Representation |
---|---|
bin | 110011001110110111… |
… | …0100101100111110000 |
3 | 101111222111211022122111 |
4 | 1212131232211213300 |
5 | 3300310211334112 |
6 | 122313115215104 |
7 | 10643260060150 |
oct | 1463556454760 |
9 | 344874738574 |
10 | 110020418032 |
11 | 42728726518 |
12 | 193a5747494 |
13 | a4b47c8695 |
14 | 5479bba760 |
15 | 2cddccc5a7 |
hex | 199dba59f0 |
110020418032 has 240 divisors, whose sum is σ = 268388536320. Its totient is φ = 42763309056.
The previous prime is 110020418009. The next prime is 110020418107. The reversal of 110020418032 is 230814020011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110020417994 and 110020418012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 101214193 + ... + 101215279.
It is an arithmetic number, because the mean of its divisors is an integer number (1118285568).
Almost surely, 2110020418032 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 110020418032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (134194268160).
110020418032 is an abundant number, since it is smaller than the sum of its proper divisors (158368118288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110020418032 is a wasteful number, since it uses less digits than its factorization.
110020418032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1248 (or 1225 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 110020418032 its reverse (230814020011), we get a palindrome (340834438043).
The spelling of 110020418032 in words is "one hundred ten billion, twenty million, four hundred eighteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •