Base | Representation |
---|---|
bin | 11000000111001… |
… | …01011011100101 |
3 | 112002121012020222 |
4 | 30003211123211 |
5 | 403240010331 |
6 | 32023134125 |
7 | 5004143534 |
oct | 1403453345 |
9 | 462535228 |
10 | 202266341 |
11 | a41a0772 |
12 | 578a4345 |
13 | 32b9ba34 |
14 | 1cc1231b |
15 | 12b55b7b |
hex | c0e56e5 |
202266341 has 2 divisors, whose sum is σ = 202266342. Its totient is φ = 202266340.
The previous prime is 202266331. The next prime is 202266349. The reversal of 202266341 is 143662202.
202266341 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., 105165025 + 97101316 = 10255^2 + 9854^2 .
It is a cyclic number.
It is not a de Polignac number, because 202266341 - 26 = 202266277 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 202266341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202266349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101133170 + 101133171.
It is an arithmetic number, because the mean of its divisors is an integer number (101133171).
Almost surely, 2202266341 is an apocalyptic number.
It is an amenable number.
202266341 is a deficient number, since it is larger than the sum of its proper divisors (1).
202266341 is an equidigital number, since it uses as much as digits as its factorization.
202266341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 26.
The square root of 202266341 is about 14222.0371606883. The cubic root of 202266341 is about 587.0041965170.
The spelling of 202266341 in words is "two hundred two million, two hundred sixty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •