Base | Representation |
---|---|
bin | 1011100001011111100101… |
… | …11001011111110110101101 |
3 | 10022201111012020201100102211 |
4 | 11300233302321133312231 |
5 | 11310132444313104221 |
6 | 125521024140250421 |
7 | 5223521661430531 |
oct | 560576271376655 |
9 | 108644166640384 |
10 | 25340087238061 |
11 | 808a7416a4102 |
12 | 2a130b3b40a11 |
13 | 111a738351bbb |
14 | 638676b41bc1 |
15 | 2de2492316e1 |
hex | 170bf2e5fdad |
25340087238061 has 2 divisors, whose sum is σ = 25340087238062. Its totient is φ = 25340087238060.
The previous prime is 25340087238043. The next prime is 25340087238083. The reversal of 25340087238061 is 16083278004352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25289895556836 + 50191681225 = 5028906^2 + 224035^2 .
It is a cyclic number.
It is not a de Polignac number, because 25340087238061 - 225 = 25340053683629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 25340087237996 and 25340087238014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25340087238091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12670043619030 + 12670043619031.
It is an arithmetic number, because the mean of its divisors is an integer number (12670043619031).
Almost surely, 225340087238061 is an apocalyptic number.
It is an amenable number.
25340087238061 is a deficient number, since it is larger than the sum of its proper divisors (1).
25340087238061 is an equidigital number, since it uses as much as digits as its factorization.
25340087238061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1935360, while the sum is 49.
The spelling of 25340087238061 in words is "twenty-five trillion, three hundred forty billion, eighty-seven million, two hundred thirty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •