Base | Representation |
---|---|
bin | 1011110000100010111… |
… | …1000010101010000101 |
3 | 201022102102110220000011 |
4 | 2330020233002222011 |
5 | 11302204030343133 |
6 | 232445131350221 |
7 | 20410665526105 |
oct | 2741057025205 |
9 | 638372426004 |
10 | 202010012293 |
11 | 78743427191 |
12 | 331988b2371 |
13 | 1608489086b |
14 | 9ac5025205 |
15 | 53c4b636cd |
hex | 2f08bc2a85 |
202010012293 has 2 divisors, whose sum is σ = 202010012294. Its totient is φ = 202010012292.
The previous prime is 202010012221. The next prime is 202010012363. The reversal of 202010012293 is 392210010202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189483478209 + 12526534084 = 435297^2 + 111922^2 .
It is a cyclic number.
It is not a de Polignac number, because 202010012293 - 233 = 193420077701 is a prime.
It is a super-2 number, since 2×2020100122932 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202010012693) 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, 101005006146 + 101005006147.
It is an arithmetic number, because the mean of its divisors is an integer number (101005006147).
Almost surely, 2202010012293 is an apocalyptic number.
It is an amenable number.
202010012293 is a deficient number, since it is larger than the sum of its proper divisors (1).
202010012293 is an equidigital number, since it uses as much as digits as its factorization.
202010012293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 202010012293 its reverse (392210010202), we get a palindrome (594220022495).
The spelling of 202010012293 in words is "two hundred two billion, ten million, twelve thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •