Base | Representation |
---|---|
bin | 110011010001110101… |
… | …1101100100010010100 |
3 | 101112020110211000210122 |
4 | 1212203223230202110 |
5 | 3301011300320340 |
6 | 122331044411112 |
7 | 10645612206005 |
oct | 1464353544224 |
9 | 345213730718 |
10 | 110120323220 |
11 | 4277a062796 |
12 | 194130a6a98 |
13 | a4cc407c8b |
14 | 54891851ac |
15 | 2ce7963db5 |
hex | 19a3aec894 |
110120323220 has 48 divisors (see below), whose sum is σ = 241621712640. Its totient is φ = 42078068736.
The previous prime is 110120323219. The next prime is 110120323303. The reversal of 110120323220 is 22323021011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 198089 + ... + 509391.
It is an arithmetic number, because the mean of its divisors is an integer number (5033785680).
Almost surely, 2110120323220 is an apocalyptic number.
110120323220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110120323220, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120810856320).
110120323220 is an abundant number, since it is smaller than the sum of its proper divisors (131501389420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110120323220 is a wasteful number, since it uses less digits than its factorization.
110120323220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 312104 (or 312102 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 110120323220 its reverse (22323021011), we get a palindrome (132443344231).
The spelling of 110120323220 in words is "one hundred ten billion, one hundred twenty million, three hundred twenty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •