Base | Representation |
---|---|
bin | 10000001011110000001… |
… | …011011101110101110110 |
3 | 10221022121022212111111120 |
4 | 100023300023131311312 |
5 | 121210121030200042 |
6 | 2210523405044410 |
7 | 143230434243045 |
oct | 20136013356566 |
9 | 3838538774446 |
10 | 1112131100022 |
11 | 39971a015a98 |
12 | 15b656556706 |
13 | 80b48152177 |
14 | 3bb8269055c |
15 | 1dde09badec |
hex | 102f02ddd76 |
1112131100022 has 32 divisors (see below), whose sum is σ = 2276749728000. Its totient is φ = 361968206880.
The previous prime is 1112131100009. The next prime is 1112131100023. The reversal of 1112131100022 is 2200011312111.
It is a super-2 number, since 2×11121311000222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1112131099974 and 1112131100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112131100023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55072 + ... + 1492412.
It is an arithmetic number, because the mean of its divisors is an integer number (71148429000).
Almost surely, 21112131100022 is an apocalyptic number.
1112131100022 is an abundant number, since it is smaller than the sum of its proper divisors (1164618627978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112131100022 is a wasteful number, since it uses less digits than its factorization.
1112131100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1440388.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1112131100022 its reverse (2200011312111), we get a palindrome (3312142412133).
The spelling of 1112131100022 in words is "one trillion, one hundred twelve billion, one hundred thirty-one million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •