Base | Representation |
---|---|
bin | 11000001011001… |
… | …11000101001101 |
3 | 112010121011201102 |
4 | 30011213011031 |
5 | 403404004024 |
6 | 32042352445 |
7 | 5011515014 |
oct | 1405470515 |
9 | 463534642 |
10 | 202797389 |
11 | a4523753 |
12 | 57abb725 |
13 | 33026672 |
14 | 1cd0da7b |
15 | 12c0d1ae |
hex | c16714d |
202797389 has 2 divisors, whose sum is σ = 202797390. Its totient is φ = 202797388.
The previous prime is 202797359. The next prime is 202797391. The reversal of 202797389 is 983797202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 172712164 + 30085225 = 13142^2 + 5485^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202797389 is a prime.
It is a super-2 number, since 2×2027973892 = 82253561970434642, which contains 22 as substring.
Together with 202797391, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202797359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101398694 + 101398695.
It is an arithmetic number, because the mean of its divisors is an integer number (101398695).
Almost surely, 2202797389 is an apocalyptic number.
It is an amenable number.
202797389 is a deficient number, since it is larger than the sum of its proper divisors (1).
202797389 is an equidigital number, since it uses as much as digits as its factorization.
202797389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 381024, while the sum is 47.
The square root of 202797389 is about 14240.6948215317. The cubic root of 202797389 is about 587.5174718812.
The spelling of 202797389 in words is "two hundred two million, seven hundred ninety-seven thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •