Base | Representation |
---|---|
bin | 11111100111110… |
… | …00000010100001 |
3 | 200111010110100211 |
4 | 33303320002201 |
5 | 1020401211441 |
6 | 42153214121 |
7 | 6400435243 |
oct | 1763700241 |
9 | 614113324 |
10 | 265257121 |
11 | 126804668 |
12 | 74a01341 |
13 | 42c5509c |
14 | 2732c093 |
15 | 18449a81 |
hex | fcf80a1 |
265257121 has 2 divisors, whose sum is σ = 265257122. Its totient is φ = 265257120.
The previous prime is 265257079. The next prime is 265257131. The reversal of 265257121 is 121752562.
265257121 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., 195300625 + 69956496 = 13975^2 + 8364^2 .
It is a cyclic number.
It is not a de Polignac number, because 265257121 - 27 = 265256993 is a prime.
It is a super-2 number, since 2×2652571212 = 140722680482417282, which contains 22 as substring.
It is equal to p14467054 and since 265257121 and 14467054 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (265257131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 132628560 + 132628561.
It is an arithmetic number, because the mean of its divisors is an integer number (132628561).
Almost surely, 2265257121 is an apocalyptic number.
It is an amenable number.
265257121 is a deficient number, since it is larger than the sum of its proper divisors (1).
265257121 is an equidigital number, since it uses as much as digits as its factorization.
265257121 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8400, while the sum is 31.
The square root of 265257121 is about 16286.7160901147. The cubic root of 265257121 is about 642.5235011868.
The spelling of 265257121 in words is "two hundred sixty-five million, two hundred fifty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •