Base | Representation |
---|---|
bin | 10110111111010111111001… |
… | …100000010011011011011111 |
3 | 111021000012202220101220120111 |
4 | 112333113321200103123133 |
5 | 101223104344321010421 |
6 | 555014114444030451 |
7 | 30204046615465441 |
oct | 2677277140233337 |
9 | 437005686356514 |
10 | 101112011110111 |
11 | 2a2433aa317a51 |
12 | b410227b32427 |
13 | 4455a8b475961 |
14 | 1ad7bc158a491 |
15 | ba524e987ee1 |
hex | 5bf5f98136df |
101112011110111 has 8 divisors (see below), whose sum is σ = 106990940390400. Its totient is φ = 95288806278360.
The previous prime is 101112011110063. The next prime is 101112011110151. The reversal of 101112011110111 is 111011110211101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-101112011110111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101112011110091 and 101112011110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101112011110151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13931108401 + ... + 13931115658.
It is an arithmetic number, because the mean of its divisors is an integer number (13373867548800).
Almost surely, 2101112011110111 is an apocalyptic number.
101112011110111 is a deficient number, since it is larger than the sum of its proper divisors (5878929280289).
101112011110111 is a wasteful number, since it uses less digits than its factorization.
101112011110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27862224269.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 101112011110111 its reverse (111011110211101), we get a palindrome (212123121321212).
The spelling of 101112011110111 in words is "one hundred one trillion, one hundred twelve billion, eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •