Base | Representation |
---|---|
bin | 11001010001000001100101… |
… | …110000001001010110000000 |
3 | 112120110001222120212112001120 |
4 | 121101001211300021112000 |
5 | 104031102003324031422 |
6 | 1032200155025032240 |
7 | 32256143321016645 |
oct | 3121014560112600 |
9 | 476401876775046 |
10 | 111121101002112 |
11 | 3245221565a403 |
12 | 1056801ba85680 |
13 | 4a008a08961a6 |
14 | 1d6240ba0ddcc |
15 | cca7ac91245c |
hex | 651065c09580 |
111121101002112 has 64 divisors (see below), whose sum is σ = 295195760718960. Its totient is φ = 37036560107520.
The previous prime is 111121101002039. The next prime is 111121101002129. The reversal of 111121101002112 is 211200101121111.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 111121101002091 and 111121101002100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11128339 + ... + 18603282.
Almost surely, 2111121101002112 is an apocalyptic number.
111121101002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111121101002112 is an abundant number, since it is smaller than the sum of its proper divisors (184074659716848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111121101002112 is an equidigital number, since it uses as much as digits as its factorization.
111121101002112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29741371 (or 29741359 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 111121101002112 its reverse (211200101121111), we get a palindrome (322321202123223).
The spelling of 111121101002112 in words is "one hundred eleven trillion, one hundred twenty-one billion, one hundred one million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •