Base | Representation |
---|---|
bin | 1011111011001010101100… |
… | …1110111111101010010101 |
3 | 1201102102002000020212221100 |
4 | 2332302223032333222111 |
5 | 3204303024413201401 |
6 | 43515055010140313 |
7 | 2522150413612263 |
oct | 276625316775225 |
9 | 51372060225840 |
10 | 13111113022101 |
11 | 41a5434549886 |
12 | 1579031281699 |
13 | 7414ac945283 |
14 | 33481cd77433 |
15 | 17b0b4338b86 |
hex | becab3bfa95 |
13111113022101 has 6 divisors (see below), whose sum is σ = 18938274365270. Its totient is φ = 8740742014728.
The previous prime is 13111113022057. The next prime is 13111113022103. The reversal of 13111113022101 is 10122031111131.
13111113022101 is a `hidden beast` number, since 1 + 311 + 1 + 1 + 130 + 221 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 7213253062500 + 5897859959601 = 2685750^2 + 2428551^2 .
It is not a de Polignac number, because 13111113022101 - 213 = 13111113013909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111113022103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 728395167886 + ... + 728395167903.
Almost surely, 213111113022101 is an apocalyptic number.
It is an amenable number.
13111113022101 is a deficient number, since it is larger than the sum of its proper divisors (5827161343169).
13111113022101 is a wasteful number, since it uses less digits than its factorization.
13111113022101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1456790335795 (or 1456790335792 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 13111113022101 its reverse (10122031111131), we get a palindrome (23233144133232).
The spelling of 13111113022101 in words is "thirteen trillion, one hundred eleven billion, one hundred thirteen million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •