Base | Representation |
---|---|
bin | 1100000000111100010010… |
… | …0000001100101101100011 |
3 | 1201202220010222222000110202 |
4 | 3000033010200030231203 |
5 | 3212414214212211321 |
6 | 44032423210015415 |
7 | 2532262034366306 |
oct | 300170440145543 |
9 | 51686128860422 |
10 | 13210321210211 |
11 | 4233513a26994 |
12 | 15942b9a1756b |
13 | 74a9603aaa68 |
14 | 339550ba0b3d |
15 | 17d96dcb770b |
hex | c03c480cb63 |
13210321210211 has 4 divisors (see below), whose sum is σ = 13210830638112. Its totient is φ = 13209811782312.
The previous prime is 13210321210201. The next prime is 13210321210213. The reversal of 13210321210211 is 11201212301231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13210321210211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13210321210213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 254675051 + ... + 254726916.
It is an arithmetic number, because the mean of its divisors is an integer number (3302707659528).
Almost surely, 213210321210211 is an apocalyptic number.
13210321210211 is a deficient number, since it is larger than the sum of its proper divisors (509427901).
13210321210211 is an equidigital number, since it uses as much as digits as its factorization.
13210321210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509427900.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13210321210211 its reverse (11201212301231), we get a palindrome (24411533511442).
The spelling of 13210321210211 in words is "thirteen trillion, two hundred ten billion, three hundred twenty-one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •