Base | Representation |
---|---|
bin | 11001000000110111110101… |
… | …101111000010101011101010 |
3 | 112102111221221002222111111020 |
4 | 121000313311233002223222 |
5 | 103404410233221231442 |
6 | 1025550224430113310 |
7 | 32113020053030421 |
oct | 3100676557025352 |
9 | 472457832874436 |
10 | 110011120102122 |
11 | 320644aa34a538 |
12 | 10408a8564b836 |
13 | 495000905a345 |
14 | 1d247d0b562b8 |
15 | cab995ac79ec |
hex | 640df5bc2aea |
110011120102122 has 16 divisors (see below), whose sum is σ = 220052343211680. Its totient is φ = 36665356199472.
The previous prime is 110011120102067. The next prime is 110011120102123. The reversal of 110011120102122 is 221201021110011.
It is a happy number.
It is a super-2 number, since 2×1100111201021222 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110011120102123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1254244468 + ... + 1254332175.
It is an arithmetic number, because the mean of its divisors is an integer number (13753271450730).
Almost surely, 2110011120102122 is an apocalyptic number.
110011120102122 is an abundant number, since it is smaller than the sum of its proper divisors (110041223109558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110011120102122 is a wasteful number, since it uses less digits than its factorization.
110011120102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2508583957.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110011120102122 its reverse (221201021110011), we get a palindrome (331212141212133).
The spelling of 110011120102122 in words is "one hundred ten trillion, eleven billion, one hundred twenty million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •