Base | Representation |
---|---|
bin | 10000010011001011001… |
… | …010110010101111111000 |
3 | 10222002011200221200220002 |
4 | 100103023022302233320 |
5 | 121322431111213422 |
6 | 2214322240252132 |
7 | 143632060524266 |
oct | 20231312625770 |
9 | 3862150850802 |
10 | 1120100101112 |
11 | 3a2039340503 |
12 | 1610bb311048 |
13 | 81818130725 |
14 | 3c2daba9436 |
15 | 1e20a3e1692 |
hex | 104cb2b2bf8 |
1120100101112 has 8 divisors (see below), whose sum is σ = 2100187689600. Its totient is φ = 560050050552.
The previous prime is 1120100101091. The next prime is 1120100101129. The reversal of 1120100101112 is 2111010010211.
It is a tau number, because it is divible by the number of its divisors (8).
It is a super-2 number, since 2×11201001011122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1120100101093 and 1120100101102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70006256312 + ... + 70006256327.
It is an arithmetic number, because the mean of its divisors is an integer number (262523461200).
Almost surely, 21120100101112 is an apocalyptic number.
It is an amenable number.
1120100101112 is a deficient number, since it is larger than the sum of its proper divisors (980087588488).
1120100101112 is a wasteful number, since it uses less digits than its factorization.
1120100101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140012512645 (or 140012512641 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1120100101112 its reverse (2111010010211), we get a palindrome (3231110111323).
Subtracting 1120100101112 from its reverse (2111010010211), we obtain a palindrome (990909909099).
The spelling of 1120100101112 in words is "one trillion, one hundred twenty billion, one hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •