Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0010110111011011110 |
3 | 101112012202102010020100 |
4 | 1212203010112323132 |
5 | 3301001130323402 |
6 | 122330035401530 |
7 | 10645425436350 |
oct | 1464304267336 |
9 | 345182363210 |
10 | 110110011102 |
11 | 4277425a083 |
12 | 1940b7532a6 |
13 | a4ca237330 |
14 | 5487a5d0d0 |
15 | 2ce6ac871c |
hex | 19a3116ede |
110110011102 has 384 divisors, whose sum is σ = 314865008640. Its totient is φ = 27030620160.
The previous prime is 110110011083. The next prime is 110110011127. The reversal of 110110011102 is 201110011011.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 193514674 + ... + 193515242.
It is an arithmetic number, because the mean of its divisors is an integer number (819960960).
Almost surely, 2110110011102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110110011102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157432504320).
110110011102 is an abundant number, since it is smaller than the sum of its proper divisors (204754997538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110011102 is a wasteful number, since it uses less digits than its factorization.
110110011102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 768 (or 765 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 110110011102 its reverse (201110011011), we get a palindrome (311220022113).
Subtracting 110110011102 from its reverse (201110011011), we obtain a palindrome (90999999909).
The spelling of 110110011102 in words is "one hundred ten billion, one hundred ten million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •