Base | Representation |
---|---|
bin | 1100000000011101010110… |
… | …1110011100000010101101 |
3 | 1201202002201111012002010122 |
4 | 3000013111232130002231 |
5 | 3212300214134033401 |
6 | 44024531355014325 |
7 | 2531546240220005 |
oct | 300072556340255 |
9 | 51662644162118 |
10 | 13202020221101 |
11 | 422aa44269a08 |
12 | 1592781a3a3a5 |
13 | 749c396b189a |
14 | 338da4547005 |
15 | 17d63516521b |
hex | c01d5b9c0ad |
13202020221101 has 2 divisors, whose sum is σ = 13202020221102. Its totient is φ = 13202020221100.
The previous prime is 13202020220989. The next prime is 13202020221161. The reversal of 13202020221101 is 10112202020231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9436968961225 + 3765051259876 = 3071965^2 + 1940374^2 .
It is a cyclic number.
It is not a de Polignac number, because 13202020221101 - 218 = 13202019958957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13202020221101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13202020221161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6601010110550 + 6601010110551.
It is an arithmetic number, because the mean of its divisors is an integer number (6601010110551).
Almost surely, 213202020221101 is an apocalyptic number.
It is an amenable number.
13202020221101 is a deficient number, since it is larger than the sum of its proper divisors (1).
13202020221101 is an equidigital number, since it uses as much as digits as its factorization.
13202020221101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 13202020221101 its reverse (10112202020231), we get a palindrome (23314222241332).
The spelling of 13202020221101 in words is "thirteen trillion, two hundred two billion, twenty million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •