Base | Representation |
---|---|
bin | 10110111111010110000001… |
… | …101100101110100100101101 |
3 | 111021000000120211012212120100 |
4 | 112333112001230232210231 |
5 | 101223041240240213401 |
6 | 555013143202341313 |
7 | 30203646040626036 |
oct | 2677260154564455 |
9 | 437000524185510 |
10 | 101110001101101 |
11 | 2a242568764483 |
12 | b40b96695a839 |
13 | 445582ac05905 |
14 | 1ad7a70647a8d |
15 | ba5183299b86 |
hex | 5bf581b2e92d |
101110001101101 has 12 divisors (see below), whose sum is σ = 146049857509660. Its totient is φ = 67405708258560.
The previous prime is 101110001101073. The next prime is 101110001101139. The reversal of 101110001101101 is 101101100011101.
It can be written as a sum of positive squares in 2 ways, for example, as 19886016471876 + 81223984629225 = 4459374^2 + 9012435^2 .
It is a de Polignac number, because none of the positive numbers 2k-101110001101101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101110001101001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79260580 + ... + 80526141.
Almost surely, 2101110001101101 is an apocalyptic number.
It is an amenable number.
101110001101101 is a deficient number, since it is larger than the sum of its proper divisors (44939856408559).
101110001101101 is a wasteful number, since it uses less digits than its factorization.
101110001101101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159857036 (or 159857033 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101110001101101 its reverse (101101100011101), we get a palindrome (202211101112202).
The spelling of 101110001101101 in words is "one hundred one trillion, one hundred ten billion, one million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •