Base | Representation |
---|---|
bin | 1011111011001010101110… |
… | …1001101100001000110101 |
3 | 1201102102002111102102021120 |
4 | 2332302223221230020311 |
5 | 3204303033211120041 |
6 | 43515055420134153 |
7 | 2522150530236342 |
oct | 276625351541065 |
9 | 51372074372246 |
10 | 13111120020021 |
11 | 41a5438499491 |
12 | 1579033697359 |
13 | 7414b122555a |
14 | 33481dc797c9 |
15 | 17b0b4c6c366 |
hex | becaba6c235 |
13111120020021 has 4 divisors (see below), whose sum is σ = 17481493360032. Its totient is φ = 8740746680012.
The previous prime is 13111120020017. The next prime is 13111120020109. The reversal of 13111120020021 is 12002002111131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13111120020021 - 22 = 13111120020017 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111120020421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2185186670001 + ... + 2185186670006.
It is an arithmetic number, because the mean of its divisors is an integer number (4370373340008).
Almost surely, 213111120020021 is an apocalyptic number.
It is an amenable number.
13111120020021 is a deficient number, since it is larger than the sum of its proper divisors (4370373340011).
13111120020021 is an equidigital number, since it uses as much as digits as its factorization.
13111120020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4370373340010.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 13111120020021 its reverse (12002002111131), we get a palindrome (25113122131152).
The spelling of 13111120020021 in words is "thirteen trillion, one hundred eleven billion, one hundred twenty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •