Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100101011000000011111 |
3 | 111020222011100112021011011200 |
4 | 112333031221030223000133 |
5 | 101222414322012010421 |
6 | 555005054104050543 |
7 | 30203210013516561 |
oct | 2677155114530037 |
9 | 436864315234150 |
10 | 101101000110111 |
11 | 2a239769956751 |
12 | b40a074463a53 |
13 | 4454a25199541 |
14 | 1ad7459055331 |
15 | ba4d07e74726 |
hex | 5bf36932b01f |
101101000110111 has 12 divisors (see below), whose sum is σ = 146034950153040. Its totient is φ = 67400587255680.
The previous prime is 101101000110013. The next prime is 101101000110113. The reversal of 101101000110111 is 111011000101101.
It is not a de Polignac number, because 101101000110111 - 211 = 101101000108063 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 = 101101000110093 and 101101000110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101000110113) 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, 2026630 + ... + 14363468.
It is an arithmetic number, because the mean of its divisors is an integer number (12169579179420).
Almost surely, 2101101000110111 is an apocalyptic number.
101101000110111 is a deficient number, since it is larger than the sum of its proper divisors (44933950042929).
101101000110111 is a wasteful number, since it uses less digits than its factorization.
101101000110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13247406 (or 13247403 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101101000110111 its reverse (111011000101101), we get a palindrome (212112000211212).
The spelling of 101101000110111 in words is "one hundred one trillion, one hundred one billion, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •