Base | Representation |
---|---|
bin | 101101111110101100001111… |
… | …001111110100000000101001 |
3 | 222112000001200111111202211011 |
4 | 231332230033033310000221 |
5 | 203001133432424013001 |
6 | 1554030402230103521 |
7 | 60410633044410331 |
oct | 5576541717640051 |
9 | 875001614452734 |
10 | 202220201001001 |
11 | 59485118660387 |
12 | 1a81b7681aaba1 |
13 | 88ab38b064b41 |
14 | 37d171d4400c1 |
15 | 185a328c12d51 |
hex | b7eb0f3f4029 |
202220201001001 has 2 divisors, whose sum is σ = 202220201001002. Its totient is φ = 202220201001000.
The previous prime is 202220201000999. The next prime is 202220201001043. The reversal of 202220201001001 is 100100102022202.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143763457219600 + 58456743781401 = 11990140^2 + 7645701^2 .
It is a cyclic number.
It is not a de Polignac number, because 202220201001001 - 21 = 202220201000999 is a prime.
Together with 202220201000999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (202220204001001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101110100500500 + 101110100500501.
It is an arithmetic number, because the mean of its divisors is an integer number (101110100500501).
Almost surely, 2202220201001001 is an apocalyptic number.
It is an amenable number.
202220201001001 is a deficient number, since it is larger than the sum of its proper divisors (1).
202220201001001 is an equidigital number, since it uses as much as digits as its factorization.
202220201001001 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 13.
Adding to 202220201001001 its reverse (100100102022202), we get a palindrome (302320303023203).
The spelling of 202220201001001 in words is "two hundred two trillion, two hundred twenty billion, two hundred one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •