Base | Representation |
---|---|
bin | 1011111011001110… |
… | …1011110110110101 |
3 | 22021002122211022111 |
4 | 2332303223312311 |
5 | 23024003020041 |
6 | 1245353131021 |
7 | 142220630656 |
oct | 27663536665 |
9 | 8232584274 |
10 | 3201220021 |
11 | 13a3006a8a |
12 | 7540b9a71 |
13 | 3c02a7c3c |
14 | 22522552d |
15 | 13b08e981 |
hex | becebdb5 |
3201220021 has 2 divisors, whose sum is σ = 3201220022. Its totient is φ = 3201220020.
The previous prime is 3201219949. The next prime is 3201220031. The reversal of 3201220021 is 1200221023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2093062500 + 1108157521 = 45750^2 + 33289^2 .
It is an emirp because it is prime and its reverse (1200221023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3201220021 - 27 = 3201219893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3201219983 and 3201220010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3201220031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1600610010 + 1600610011.
It is an arithmetic number, because the mean of its divisors is an integer number (1600610011).
Almost surely, 23201220021 is an apocalyptic number.
It is an amenable number.
3201220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3201220021 is an equidigital number, since it uses as much as digits as its factorization.
3201220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 3201220021 is about 56579.3250313222. The cubic root of 3201220021 is about 1473.7998504860.
Adding to 3201220021 its reverse (1200221023), we get a palindrome (4401441044).
The spelling of 3201220021 in words is "three billion, two hundred one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •