Base | Representation |
---|---|
bin | 1011101100010110100111… |
… | …01000001110000001000001 |
3 | 10101001011022211210221012101 |
4 | 11312023103220032001001 |
5 | 11332241141020111401 |
6 | 130404254204430401 |
7 | 5262501452215135 |
oct | 566132350160101 |
9 | 111034284727171 |
10 | 25713224769601 |
11 | 8213a10049346 |
12 | 2a7348ab48401 |
13 | 1146992634295 |
14 | 64c7534633c5 |
15 | 2e8cd76b0101 |
hex | 1762d3a0e041 |
25713224769601 has 2 divisors, whose sum is σ = 25713224769602. Its totient is φ = 25713224769600.
The previous prime is 25713224769503. The next prime is 25713224769733. The reversal of 25713224769601 is 10696742231752.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18112037918976 + 7601186850625 = 4255824^2 + 2757025^2 .
It is a cyclic number.
It is not a de Polignac number, because 25713224769601 - 27 = 25713224769473 is a prime.
It is a super-2 number, since 2×257132247696012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (25713224769901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12856612384800 + 12856612384801.
It is an arithmetic number, because the mean of its divisors is an integer number (12856612384801).
Almost surely, 225713224769601 is an apocalyptic number.
It is an amenable number.
25713224769601 is a deficient number, since it is larger than the sum of its proper divisors (1).
25713224769601 is an equidigital number, since it uses as much as digits as its factorization.
25713224769601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7620480, while the sum is 55.
The spelling of 25713224769601 in words is "twenty-five trillion, seven hundred thirteen billion, two hundred twenty-four million, seven hundred sixty-nine thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •