Base | Representation |
---|---|
bin | 11001000000111000110111… |
… | …010010111001100110000010 |
3 | 112102112001202202200011200222 |
4 | 121000320313102321212002 |
5 | 103404420011311133442 |
6 | 1025550525521143042 |
7 | 32113056240135356 |
oct | 3100706722714602 |
9 | 472461682604628 |
10 | 110012220021122 |
11 | 32064a14209a01 |
12 | 10409131a8aa82 |
13 | 4950152bb01a3 |
14 | 1d24896c73466 |
15 | caba0c4448d2 |
hex | 640e374b9982 |
110012220021122 has 16 divisors (see below), whose sum is σ = 174758115498912. Its totient is φ = 51760730591040.
The previous prime is 110012220021049. The next prime is 110012220021167. The reversal of 110012220021122 is 221120022210011.
It is a super-2 number, since 2×1100122200211222 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 110012220021122.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 303750404 + ... + 304112367.
It is an arithmetic number, because the mean of its divisors is an integer number (10922382218682).
Almost surely, 2110012220021122 is an apocalyptic number.
110012220021122 is a deficient number, since it is larger than the sum of its proper divisors (64745895477790).
110012220021122 is a wasteful number, since it uses less digits than its factorization.
110012220021122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607868113.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110012220021122 its reverse (221120022210011), we get a palindrome (331132242231133).
The spelling of 110012220021122 in words is "one hundred ten trillion, twelve billion, two hundred twenty million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •