Base | Representation |
---|---|
bin | 10000010100000000111… |
… | …011101001100101111000 |
3 | 10222011111120020001021111 |
4 | 100110000323221211320 |
5 | 121331303014213422 |
6 | 2214551541250104 |
7 | 143663322433015 |
oct | 20240073514570 |
9 | 3864446201244 |
10 | 1121002101112 |
11 | 3a2461509453 |
12 | 161311403934 |
13 | 8192cc7753a |
14 | 3c3848c670c |
15 | 1e25e6b5a77 |
hex | 10500ee9978 |
1121002101112 has 8 divisors (see below), whose sum is σ = 2101878939600. Its totient is φ = 560501050552.
The previous prime is 1121002101083. The next prime is 1121002101137. The reversal of 1121002101112 is 2111012001211.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 1121002101092 and 1121002101101.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 70062631312 + ... + 70062631327.
It is an arithmetic number, because the mean of its divisors is an integer number (262734867450).
Almost surely, 21121002101112 is an apocalyptic number.
It is an amenable number.
1121002101112 is a deficient number, since it is larger than the sum of its proper divisors (980876838488).
1121002101112 is a wasteful number, since it uses less digits than its factorization.
1121002101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140125262645 (or 140125262641 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1121002101112 its reverse (2111012001211), we get a palindrome (3232014102323).
Subtracting 1121002101112 from its reverse (2111012001211), we obtain a palindrome (990009900099).
The spelling of 1121002101112 in words is "one trillion, one hundred twenty-one billion, two million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •