Base | Representation |
---|---|
bin | 1011110010000101011… |
… | …0100101000101010001 |
3 | 201100111012122100220212 |
4 | 2330201112211011101 |
5 | 11304030243430342 |
6 | 232554124013505 |
7 | 20424142236461 |
oct | 2744126450521 |
9 | 640435570825 |
10 | 202423030097 |
11 | 78935583612 |
12 | 33293091295 |
13 | 1611c30c4b2 |
14 | 9b23c17ba1 |
15 | 53eb049182 |
hex | 2f215a5151 |
202423030097 has 2 divisors, whose sum is σ = 202423030098. Its totient is φ = 202423030096.
The previous prime is 202423030093. The next prime is 202423030213. The reversal of 202423030097 is 790030324202.
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., 159491604496 + 42931425601 = 399364^2 + 207199^2 .
It is a cyclic number.
It is not a de Polignac number, because 202423030097 - 22 = 202423030093 is a prime.
It is a super-2 number, since 2×2024230300972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (202423030093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101211515048 + 101211515049.
It is an arithmetic number, because the mean of its divisors is an integer number (101211515049).
Almost surely, 2202423030097 is an apocalyptic number.
It is an amenable number.
202423030097 is a deficient number, since it is larger than the sum of its proper divisors (1).
202423030097 is an equidigital number, since it uses as much as digits as its factorization.
202423030097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 32.
Adding to 202423030097 its reverse (790030324202), we get a palindrome (992453354299).
The spelling of 202423030097 in words is "two hundred two billion, four hundred twenty-three million, thirty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •