Base | Representation |
---|---|
bin | 101101101101001110011110… |
… | …111100111010010000000001 |
3 | 222100202022210220022212022022 |
4 | 231231032132330322100001 |
5 | 202322003000401401144 |
6 | 1551311153422051225 |
7 | 60225134342642003 |
oct | 5555163674722001 |
9 | 870668726285268 |
10 | 201020021122049 |
11 | 590621263845a8 |
12 | 1a66703a419b15 |
13 | 88221504193ac |
14 | 378d5c7090373 |
15 | 1838ed3344cee |
hex | b6d39ef3a401 |
201020021122049 has 2 divisors, whose sum is σ = 201020021122050. Its totient is φ = 201020021122048.
The previous prime is 201020021121979. The next prime is 201020021122051. The reversal of 201020021122049 is 940221120020102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115598192755600 + 85421828366449 = 10751660^2 + 9242393^2 .
It is a cyclic number.
It is not a de Polignac number, because 201020021122049 - 28 = 201020021121793 is a prime.
It is a super-2 number, since 2×2010200211220492 (a number of 29 digits) contains 22 as substring.
Together with 201020021122051, 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 (201020021127049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100510010561024 + 100510010561025.
It is an arithmetic number, because the mean of its divisors is an integer number (100510010561025).
Almost surely, 2201020021122049 is an apocalyptic number.
It is an amenable number.
201020021122049 is a deficient number, since it is larger than the sum of its proper divisors (1).
201020021122049 is an equidigital number, since it uses as much as digits as its factorization.
201020021122049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
The spelling of 201020021122049 in words is "two hundred one trillion, twenty billion, twenty-one million, one hundred twenty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •