Base | Representation |
---|---|
bin | 101101111011110010101111… |
… | …001100110010111110110001 |
3 | 222111022000120022101112101212 |
4 | 231323302233030302332301 |
5 | 202434403022400231001 |
6 | 1553355101553405505 |
7 | 60360352142246333 |
oct | 5573625714627661 |
9 | 874260508345355 |
10 | 202021021102001 |
11 | 594086a780a202 |
12 | 1a7a903b269895 |
13 | 8895667915c3a |
14 | 37c5c2623b453 |
15 | 185506c7867bb |
hex | b7bcaf332fb1 |
202021021102001 has 2 divisors, whose sum is σ = 202021021102002. Its totient is φ = 202021021102000.
The previous prime is 202021021101973. The next prime is 202021021102003. The reversal of 202021021102001 is 100201120120202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135759223283776 + 66261797818225 = 11651576^2 + 8140135^2 .
It is a cyclic number.
It is not a de Polignac number, because 202021021102001 - 230 = 202019947360177 is a prime.
Together with 202021021102003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (202021021102003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101010510551000 + 101010510551001.
It is an arithmetic number, because the mean of its divisors is an integer number (101010510551001).
Almost surely, 2202021021102001 is an apocalyptic number.
It is an amenable number.
202021021102001 is a deficient number, since it is larger than the sum of its proper divisors (1).
202021021102001 is an equidigital number, since it uses as much as digits as its factorization.
202021021102001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 202021021102001 its reverse (100201120120202), we get a palindrome (302222141222203).
The spelling of 202021021102001 in words is "two hundred two trillion, twenty-one billion, twenty-one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •