Base | Representation |
---|---|
bin | 1011110000111001011… |
… | …0011010101010001101 |
3 | 201022122222202011002122 |
4 | 2330032112122222031 |
5 | 11302402140022201 |
6 | 232502334502325 |
7 | 20413221346034 |
oct | 2741626325215 |
9 | 638588664078 |
10 | 202104220301 |
11 | 78791622045 |
12 | 332043649a5 |
13 | 1609b256c49 |
14 | 9ad374971b |
15 | 53cd071e1b |
hex | 2f0e59aa8d |
202104220301 has 2 divisors, whose sum is σ = 202104220302. Its totient is φ = 202104220300.
The previous prime is 202104220273. The next prime is 202104220309. The reversal of 202104220301 is 103022401202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 194053465225 + 8050755076 = 440515^2 + 89726^2 .
It is a cyclic number.
It is not a de Polignac number, because 202104220301 - 218 = 202103958157 is a prime.
It is a super-2 number, since 2×2021042203012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 202104220301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202104220309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101052110150 + 101052110151.
It is an arithmetic number, because the mean of its divisors is an integer number (101052110151).
Almost surely, 2202104220301 is an apocalyptic number.
It is an amenable number.
202104220301 is a deficient number, since it is larger than the sum of its proper divisors (1).
202104220301 is an equidigital number, since it uses as much as digits as its factorization.
202104220301 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 202104220301 its reverse (103022401202), we get a palindrome (305126621503).
The spelling of 202104220301 in words is "two hundred two billion, one hundred four million, two hundred twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •