Base | Representation |
---|---|
bin | 1011110001110010001… |
… | …0101101011100100001 |
3 | 201100021120210001222012 |
4 | 2330130202231130201 |
5 | 11303344113332001 |
6 | 232542122122305 |
7 | 20422142242646 |
oct | 2743442553441 |
9 | 640246701865 |
10 | 202342324001 |
11 | 788a3a6a964 |
12 | 33270050395 |
13 | 161086928cc |
14 | 9b17209dcd |
15 | 53e3e062bb |
hex | 2f1c8ad721 |
202342324001 has 2 divisors, whose sum is σ = 202342324002. Its totient is φ = 202342324000.
The previous prime is 202342323959. The next prime is 202342324021. The reversal of 202342324001 is 100423243202.
202342324001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153918120976 + 48424203025 = 392324^2 + 220055^2 .
It is a cyclic number.
It is not a de Polignac number, because 202342324001 - 226 = 202275215137 is a prime.
It is not a weakly prime, because it can be changed into another prime (202342324021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101171162000 + 101171162001.
It is an arithmetic number, because the mean of its divisors is an integer number (101171162001).
Almost surely, 2202342324001 is an apocalyptic number.
It is an amenable number.
202342324001 is a deficient number, since it is larger than the sum of its proper divisors (1).
202342324001 is an equidigital number, since it uses as much as digits as its factorization.
202342324001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 202342324001 its reverse (100423243202), we get a palindrome (302765567203).
The spelling of 202342324001 in words is "two hundred two billion, three hundred forty-two million, three hundred twenty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •