Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100010000101000111111 |
3 | 111020222011100112001200000200 |
4 | 112333031221030100220333 |
5 | 101222414322000031421 |
6 | 555005054101454543 |
7 | 30203210012556654 |
oct | 2677155114205077 |
9 | 436864315050020 |
10 | 101101000002111 |
11 | 2a23976989259a |
12 | b40a074411453 |
13 | 4454a2515c335 |
14 | 1ad7459027c2b |
15 | ba4d07e52726 |
hex | 5bf369310a3f |
101101000002111 has 72 divisors (see below), whose sum is σ = 163235064872880. Its totient is φ = 60081161882112.
The previous prime is 101101000002109. The next prime is 101101000002133. The reversal of 101101000002111 is 111200000101101.
It is not a de Polignac number, because 101101000002111 - 21 = 101101000002109 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 = 101101000002093 and 101101000002102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101101000002161) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 208483321 + ... + 208967693.
It is an arithmetic number, because the mean of its divisors is an integer number (2267153678790).
Almost surely, 2101101000002111 is an apocalyptic number.
101101000002111 is a deficient number, since it is larger than the sum of its proper divisors (62134064870769).
101101000002111 is a wasteful number, since it uses less digits than its factorization.
101101000002111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 488213 (or 488191 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101101000002111 its reverse (111200000101101), we get a palindrome (212301000103212).
The spelling of 101101000002111 in words is "one hundred one trillion, one hundred one billion, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •