Base | Representation |
---|---|
bin | 10110111111010110000111… |
… | …100110000010010001111111 |
3 | 111021000000211201022222020000 |
4 | 112333112013212002101333 |
5 | 101223041441100310421 |
6 | 555013201054325343 |
7 | 30203651351425353 |
oct | 2677260746022177 |
9 | 437000751288200 |
10 | 101110100010111 |
11 | 2a242609580265 |
12 | b40b993ab9853 |
13 | 445584555695a |
14 | 1ad7a7d833463 |
15 | ba518bcd6226 |
hex | 5bf58798247f |
101110100010111 has 20 divisors (see below), whose sum is σ = 151041787096200. Its totient is φ = 67406388141456.
The previous prime is 101110100010103. The next prime is 101110100010229. The reversal of 101110100010111 is 111010001011101.
It is not a de Polignac number, because 101110100010111 - 23 = 101110100010103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 101110100010093 and 101110100010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110100080111) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 13236480 + ... + 19427418.
It is an arithmetic number, because the mean of its divisors is an integer number (7552089354810).
Almost surely, 2101110100010111 is an apocalyptic number.
101110100010111 is a deficient number, since it is larger than the sum of its proper divisors (49931687086089).
101110100010111 is an equidigital number, since it uses as much as digits as its factorization.
101110100010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6392580 (or 6392571 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101110100010111 its reverse (111010001011101), we get a palindrome (212120101021212).
The spelling of 101110100010111 in words is "one hundred one trillion, one hundred ten billion, one hundred million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •