Base | Representation |
---|---|
bin | 10000010100000010001… |
… | …000010100100100110000 |
3 | 10222011112222001011220220 |
4 | 100110002020110210300 |
5 | 121331323140400422 |
6 | 2214553540133040 |
7 | 143663655323463 |
oct | 20240210244460 |
9 | 3864488034826 |
10 | 1121022200112 |
11 | 3a24718970a1 |
12 | 161318097180 |
13 | 81934193a39 |
14 | 3c3874392da |
15 | 1e261335e5c |
hex | 10502214930 |
1121022200112 has 40 divisors (see below), whose sum is σ = 2936762392320. Its totient is φ = 368411050560.
The previous prime is 1121022200101. The next prime is 1121022200147. The reversal of 1121022200112 is 2110022201211.
It is a junction number, because it is equal to n+sod(n) for n = 1121022200091 and 1121022200100.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164465812 + ... + 164472627.
It is an arithmetic number, because the mean of its divisors is an integer number (73419059808).
Almost surely, 21121022200112 is an apocalyptic number.
1121022200112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121022200112 is an abundant number, since it is smaller than the sum of its proper divisors (1815740192208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121022200112 is a wasteful number, since it uses less digits than its factorization.
1121022200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328938521 (or 328938515 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1121022200112 its reverse (2110022201211), we get a palindrome (3231044401323).
The spelling of 1121022200112 in words is "one trillion, one hundred twenty-one billion, twenty-two million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •