Base | Representation |
---|---|
bin | 1100000000011110000100… |
… | …0011100100101101100101 |
3 | 1201202010012201212122110202 |
4 | 3000013201003210231211 |
5 | 3212301111314423023 |
6 | 44025002305200245 |
7 | 2531554036031003 |
oct | 300074103445545 |
9 | 51663181778422 |
10 | 13202210311013 |
11 | 42300315a3309 |
12 | 1592815630085 |
13 | 749c69ba9219 |
14 | 338dc18a9a73 |
15 | 17d646bb3128 |
hex | c01e10e4b65 |
13202210311013 has 4 divisors (see below), whose sum is σ = 13202558224128. Its totient is φ = 13201862397900.
The previous prime is 13202210310979. The next prime is 13202210311019. The reversal of 13202210311013 is 31011301220231.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-13202210311013 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 (13202210311019) 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, 173899631 + ... + 173975532.
It is an arithmetic number, because the mean of its divisors is an integer number (3300639556032).
Almost surely, 213202210311013 is an apocalyptic number.
It is an amenable number.
13202210311013 is a deficient number, since it is larger than the sum of its proper divisors (347913115).
13202210311013 is an equidigital number, since it uses as much as digits as its factorization.
13202210311013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347913114.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13202210311013 its reverse (31011301220231), we get a palindrome (44213511531244).
The spelling of 13202210311013 in words is "thirteen trillion, two hundred two billion, two hundred ten million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •