Base | Representation |
---|---|
bin | 110011001110110110… |
… | …1110101100001101100 |
3 | 101111222111110022102100 |
4 | 1212131231311201230 |
5 | 3300310134033121 |
6 | 122313111055100 |
7 | 10643255306625 |
oct | 1463555654154 |
9 | 344874408370 |
10 | 110020221036 |
11 | 42728601510 |
12 | 193a5671490 |
13 | a4b4759b0b |
14 | 5479b68a4c |
15 | 2cddc8e026 |
hex | 199db7586c |
110020221036 has 144 divisors (see below), whose sum is σ = 321674764320. Its totient is φ = 31335413760.
The previous prime is 110020221029. The next prime is 110020221037. The reversal of 110020221036 is 630122020011.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (110020221037) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5085330 + ... + 5106918.
It is an arithmetic number, because the mean of its divisors is an integer number (2233852530).
Almost surely, 2110020221036 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 110020221036, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160837382160).
110020221036 is an abundant number, since it is smaller than the sum of its proper divisors (211654543284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110020221036 is a wasteful number, since it uses less digits than its factorization.
110020221036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22384 (or 22379 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 110020221036 its reverse (630122020011), we get a palindrome (740142241047).
The spelling of 110020221036 in words is "one hundred ten billion, twenty million, two hundred twenty-one thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •