Base | Representation |
---|---|
bin | 10000010101001001000… |
… | …011100000101000001100 |
3 | 10222021121220002102122121 |
4 | 100111021003200220030 |
5 | 121341242300333400 |
6 | 2215312004222324 |
7 | 144035314433050 |
oct | 20251103405014 |
9 | 3867556072577 |
10 | 1122212121100 |
11 | 3a2a22539374 |
12 | 1615aa69a9a4 |
13 | 81a938696b5 |
14 | 3c45b4a3c60 |
15 | 1e2d0a3021a |
hex | 105490e0a0c |
1122212121100 has 72 divisors (see below), whose sum is σ = 2810641544928. Its totient is φ = 380948928000.
The previous prime is 1122212121059. The next prime is 1122212121167. The reversal of 1122212121100 is 11212122211.
It is a super-2 number, since 2×11222121211002 (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 (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7865737 + ... + 8007136.
It is an arithmetic number, because the mean of its divisors is an integer number (39036688124).
Almost surely, 21122212121100 is an apocalyptic number.
1122212121100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122212121100 is an abundant number, since it is smaller than the sum of its proper divisors (1688429423828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122212121100 is a wasteful number, since it uses less digits than its factorization.
1122212121100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15872995 (or 15872988 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1122212121100 its reverse (11212122211), we get a palindrome (1133424243311).
The spelling of 1122212121100 in words is "one trillion, one hundred twenty-two billion, two hundred twelve million, one hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •