Base | Representation |
---|---|
bin | 10000010011000101111… |
… | …011000110010111111000 |
3 | 10222001221120100211120211 |
4 | 100103011323012113320 |
5 | 121322241044213422 |
6 | 2214305414200504 |
7 | 143626641531442 |
oct | 20230573062770 |
9 | 3861846324524 |
10 | 1120012101112 |
11 | 3a1aa36a5833 |
12 | 161095953134 |
13 | 81802b2bc18 |
14 | 3c2cd21d492 |
15 | 1e20280c577 |
hex | 104c5ec65f8 |
1120012101112 has 8 divisors (see below), whose sum is σ = 2100022689600. Its totient is φ = 560006050552.
The previous prime is 1120012101097. The next prime is 1120012101113. The reversal of 1120012101112 is 2111012100211.
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 = 1120012101092 and 1120012101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120012101113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70000756312 + ... + 70000756327.
It is an arithmetic number, because the mean of its divisors is an integer number (262502836200).
Almost surely, 21120012101112 is an apocalyptic number.
It is an amenable number.
1120012101112 is a deficient number, since it is larger than the sum of its proper divisors (980010588488).
1120012101112 is a wasteful number, since it uses less digits than its factorization.
1120012101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140001512645 (or 140001512641 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1120012101112 its reverse (2111012100211), we get a palindrome (3231024201323).
Subtracting 1120012101112 from its reverse (2111012100211), we obtain a palindrome (990999999099).
The spelling of 1120012101112 in words is "one trillion, one hundred twenty billion, twelve million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •