Base | Representation |
---|---|
bin | 11000000111100… |
… | …11110100001101 |
3 | 112002201012002012 |
4 | 30003303310031 |
5 | 403243402021 |
6 | 32024311005 |
7 | 5004510365 |
oct | 1403636415 |
9 | 462635065 |
10 | 202325261 |
11 | a4230a66 |
12 | 57912465 |
13 | 32bbc7b8 |
14 | 1cc299a5 |
15 | 12b6835b |
hex | c0f3d0d |
202325261 has 2 divisors, whose sum is σ = 202325262. Its totient is φ = 202325260.
The previous prime is 202325209. The next prime is 202325297. The reversal of 202325261 is 162523202.
202325261 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., 201469636 + 855625 = 14194^2 + 925^2 .
It is a cyclic number.
It is not a de Polignac number, because 202325261 - 26 = 202325197 is a prime.
It is a super-2 number, since 2×2023252612 = 81871022477436242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202325161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101162630 + 101162631.
It is an arithmetic number, because the mean of its divisors is an integer number (101162631).
Almost surely, 2202325261 is an apocalyptic number.
It is an amenable number.
202325261 is a deficient number, since it is larger than the sum of its proper divisors (1).
202325261 is an equidigital number, since it uses as much as digits as its factorization.
202325261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 202325261 is about 14224.1084430624. The cubic root of 202325261 is about 587.0611889118.
Adding to 202325261 its reverse (162523202), we get a palindrome (364848463).
The spelling of 202325261 in words is "two hundred two million, three hundred twenty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •