Base | Representation |
---|---|
bin | 100100101111101111100… |
… | …101110010101001001101 |
3 | 22221101220010022121011001 |
4 | 210233233211302221031 |
5 | 312333014324323031 |
6 | 5212013415300301 |
7 | 350302645203505 |
oct | 44575745625115 |
9 | 8841803277131 |
10 | 2525165464141 |
11 | 893a0a089a31 |
12 | 34948897a691 |
13 | 1541782a0218 |
14 | 8a30c00ca05 |
15 | 45a430b9861 |
hex | 24bef972a4d |
2525165464141 has 2 divisors, whose sum is σ = 2525165464142. Its totient is φ = 2525165464140.
The previous prime is 2525165464123. The next prime is 2525165464187. The reversal of 2525165464141 is 1414645615252.
It is an a-pointer prime, because the next prime (2525165464187) can be obtained adding 2525165464141 to its sum of digits (46).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1329302926116 + 1195862538025 = 1152954^2 + 1093555^2 .
It is a cyclic number.
It is not a de Polignac number, because 2525165464141 - 213 = 2525165455949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2525165464091 and 2525165464100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2525165464441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1262582732070 + 1262582732071.
It is an arithmetic number, because the mean of its divisors is an integer number (1262582732071).
Almost surely, 22525165464141 is an apocalyptic number.
It is an amenable number.
2525165464141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2525165464141 is an equidigital number, since it uses as much as digits as its factorization.
2525165464141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1152000, while the sum is 46.
The spelling of 2525165464141 in words is "two trillion, five hundred twenty-five billion, one hundred sixty-five million, four hundred sixty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •