Base | Representation |
---|---|
bin | 10000010100000111011… |
… | …111010001010011100000 |
3 | 10222011210020012200021121 |
4 | 100110013133101103200 |
5 | 121332014144231422 |
6 | 2215010511102024 |
7 | 143666126430442 |
oct | 20240737212340 |
9 | 3864706180247 |
10 | 1121112102112 |
11 | 3a2508610872 |
12 | 161342211914 |
13 | 819499b01a2 |
14 | 3c39535c492 |
15 | 1e2691938c7 |
hex | 105077d14e0 |
1121112102112 has 24 divisors (see below), whose sum is σ = 2207321649792. Its totient is φ = 560522476800.
The previous prime is 1121112102073. The next prime is 1121112102113. The reversal of 1121112102112 is 2112012111211.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121112102113) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 502189 + ... + 1579372.
It is an arithmetic number, because the mean of its divisors is an integer number (91971735408).
Almost surely, 21121112102112 is an apocalyptic number.
It is an amenable number.
1121112102112 is a deficient number, since it is larger than the sum of its proper divisors (1086209547680).
1121112102112 is a wasteful number, since it uses less digits than its factorization.
1121112102112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2098402 (or 2098394 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 1121112102112 its reverse (2112012111211), we get a palindrome (3233124213323).
Subtracting 1121112102112 from its reverse (2112012111211), we obtain a palindrome (990900009099).
The spelling of 1121112102112 in words is "one trillion, one hundred twenty-one billion, one hundred twelve million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •