Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …01011001100001110000001 |
3 | 2121212220200122021112011022 |
4 | 10203111102023030032001 |
5 | 10111002403113411001 |
6 | 110325055045155225 |
7 | 4134261513453014 |
oct | 443252213141601 |
9 | 77786618245138 |
10 | 20020221232001 |
11 | 6419589a60a21 |
12 | 22b40776bbb15 |
13 | b22b8b76aa83 |
14 | 4d2daba9137b |
15 | 24ab8a25211b |
hex | 1235522cc381 |
20020221232001 has 2 divisors, whose sum is σ = 20020221232002. Its totient is φ = 20020221232000.
The previous prime is 20020221231991. The next prime is 20020221232003. The reversal of 20020221232001 is 10023212202002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19535560209025 + 484661022976 = 4419905^2 + 696176^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020221232001 - 234 = 20003041362817 is a prime.
It is a Sophie Germain prime.
Together with 20020221232003, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20020221232003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010110616000 + 10010110616001.
It is an arithmetic number, because the mean of its divisors is an integer number (10010110616001).
Almost surely, 220020221232001 is an apocalyptic number.
It is an amenable number.
20020221232001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020221232001 is an equidigital number, since it uses as much as digits as its factorization.
20020221232001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 20020221232001 its reverse (10023212202002), we get a palindrome (30043433434003).
The spelling of 20020221232001 in words is "twenty trillion, twenty billion, two hundred twenty-one million, two hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •