Base | Representation |
---|---|
bin | 10000010011010010010… |
… | …100111110011110101000 |
3 | 10222002111001221220211121 |
4 | 100103102110332132220 |
5 | 121323202333223422 |
6 | 2214342210505024 |
7 | 143635046454232 |
oct | 20232224763650 |
9 | 3862431856747 |
10 | 1120220211112 |
11 | 3a20a0117972 |
12 | 161133595174 |
13 | 81836c95732 |
14 | 3c30cb13252 |
15 | 1e215c198c7 |
hex | 104d253e7a8 |
1120220211112 has 64 divisors (see below), whose sum is σ = 2256190750800. Its totient is φ = 519535411200.
The previous prime is 1120220211079. The next prime is 1120220211113. The reversal of 1120220211112 is 2111120220211.
It can be written as a sum of positive squares in 8 ways, for example, as 399735004516 + 720485206596 = 632246^2 + 848814^2 .
It is not an unprimeable number, because it can be changed into a prime (1120220211113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12872964 + ... + 12959692.
Almost surely, 21120220211112 is an apocalyptic number.
It is an amenable number.
1120220211112 is an abundant number, since it is smaller than the sum of its proper divisors (1135970539688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120220211112 is a wasteful number, since it uses less digits than its factorization.
1120220211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88126 (or 88122 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1120220211112 its reverse (2111120220211), we get a palindrome (3231340431323).
Subtracting 1120220211112 from its reverse (2111120220211), we obtain a palindrome (990900009099).
The spelling of 1120220211112 in words is "one trillion, one hundred twenty billion, two hundred twenty million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •