Base | Representation |
---|---|
bin | 1100000110101111101100… |
… | …0101100001000001011011 |
3 | 1202010102111021002210002001 |
4 | 3001223323011201001123 |
5 | 3221032410412211303 |
6 | 44150312255021431 |
7 | 2542421506405234 |
oct | 301537305410133 |
9 | 52112437083061 |
10 | 13310021210203 |
11 | 4271825a885a3 |
12 | 15ab6a320a877 |
13 | 75718b9bc6b3 |
14 | 3402cc04c08b |
15 | 1813569e331d |
hex | c1afb16105b |
13310021210203 has 4 divisors (see below), whose sum is σ = 13310031953088. Its totient is φ = 13310010467320.
The previous prime is 13310021210177. The next prime is 13310021210251. The reversal of 13310021210203 is 30201212001331.
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 not a de Polignac number, because 13310021210203 - 213 = 13310021202011 is a prime.
It is a super-2 number, since 2×133100212102032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13310021280203) 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, 3227851 + ... + 6085972.
It is an arithmetic number, because the mean of its divisors is an integer number (3327507988272).
Almost surely, 213310021210203 is an apocalyptic number.
13310021210203 is a deficient number, since it is larger than the sum of its proper divisors (10742885).
13310021210203 is an equidigital number, since it uses as much as digits as its factorization.
13310021210203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10742884.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 13310021210203 its reverse (30201212001331), we get a palindrome (43511233211534).
The spelling of 13310021210203 in words is "thirteen trillion, three hundred ten billion, twenty-one million, two hundred ten thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.238 sec. • engine limits •