Base | Representation |
---|---|
bin | 1100000110001110110101… |
… | …1011101011000111100111 |
3 | 1202002120201122120210122202 |
4 | 3001203231123223013213 |
5 | 3220411330230444421 |
6 | 44142253221045115 |
7 | 2541660122156264 |
oct | 301435533530747 |
9 | 52076648523582 |
10 | 13301202203111 |
11 | 426900a977a89 |
12 | 15a9a4185679b |
13 | 7563b48a01c4 |
14 | 33dad2aac26b |
15 | 180edc66910b |
hex | c18ed6eb1e7 |
13301202203111 has 4 divisors (see below), whose sum is σ = 13301212009800. Its totient is φ = 13301192396424.
The previous prime is 13301202203053. The next prime is 13301202203123. The reversal of 13301202203111 is 11130220210331.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13301202203111 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 (13301202209111) 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, 2464481 + ... + 5716298.
It is an arithmetic number, because the mean of its divisors is an integer number (3325303002450).
Almost surely, 213301202203111 is an apocalyptic number.
13301202203111 is a deficient number, since it is larger than the sum of its proper divisors (9806689).
13301202203111 is an equidigital number, since it uses as much as digits as its factorization.
13301202203111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9806688.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13301202203111 its reverse (11130220210331), we get a palindrome (24431422413442).
The spelling of 13301202203111 in words is "thirteen trillion, three hundred one billion, two hundred two million, two hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •