Base | Representation |
---|---|
bin | 1011100100101101000100… |
… | …10010101111110001100101 |
3 | 10100010000221102021010221001 |
4 | 11302112202102233301211 |
5 | 11313434411414131234 |
6 | 130043430524353301 |
7 | 5234505511040143 |
oct | 562264222576145 |
9 | 110100842233831 |
10 | 25450404052069 |
11 | 8122501662277 |
12 | 2a305609a5831 |
13 | 1127c69385ac9 |
14 | 63db40034593 |
15 | 2e2054059d14 |
hex | 1725a24afc65 |
25450404052069 has 2 divisors, whose sum is σ = 25450404052070. Its totient is φ = 25450404052068.
The previous prime is 25450404052019. The next prime is 25450404052093. The reversal of 25450404052069 is 96025040405452.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24501133819044 + 949270233025 = 4949862^2 + 974305^2 .
It is a cyclic number.
It is not a de Polignac number, because 25450404052069 - 211 = 25450404050021 is a prime.
It is a super-2 number, since 2×254504040520692 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25450404052019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12725202026034 + 12725202026035.
It is an arithmetic number, because the mean of its divisors is an integer number (12725202026035).
Almost surely, 225450404052069 is an apocalyptic number.
It is an amenable number.
25450404052069 is a deficient number, since it is larger than the sum of its proper divisors (1).
25450404052069 is an equidigital number, since it uses as much as digits as its factorization.
25450404052069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728000, while the sum is 46.
The spelling of 25450404052069 in words is "twenty-five trillion, four hundred fifty billion, four hundred four million, fifty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •