Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …101010011010000100010 |
3 | 10221010121220022021122120 |
4 | 100021331031103100202 |
5 | 121142143230413442 |
6 | 2210004142045110 |
7 | 143131563002100 |
oct | 20117515232042 |
9 | 3833556267576 |
10 | 1110202201122 |
11 | 39891a221773 |
12 | 15b1b8579796 |
13 | 808cb640881 |
14 | 3ba3c422c70 |
15 | 1dd2b4a04ec |
hex | 1027d353422 |
1110202201122 has 48 divisors (see below), whose sum is σ = 2614038975072. Its totient is φ = 313378927680.
The previous prime is 1110202201117. The next prime is 1110202201151. The reversal of 1110202201122 is 2211022020111.
It is a super-2 number, since 2×11102022011222 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22723779 + ... + 22772582.
It is an arithmetic number, because the mean of its divisors is an integer number (54459145314).
Almost surely, 21110202201122 is an apocalyptic number.
1110202201122 is an abundant number, since it is smaller than the sum of its proper divisors (1503836773950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110202201122 is a wasteful number, since it uses less digits than its factorization.
1110202201122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45496463 (or 45496456 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1110202201122 its reverse (2211022020111), we get a palindrome (3321224221233).
The spelling of 1110202201122 in words is "one trillion, one hundred ten billion, two hundred two million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •