Base | Representation |
---|---|
bin | 1011100000111010011000… |
… | …11011001110011001100001 |
3 | 10022122120122022022211012211 |
4 | 11300131030123032121201 |
5 | 11304321043242241301 |
6 | 125503522221322121 |
7 | 5222214016304344 |
oct | 560351433163141 |
9 | 108576568284184 |
10 | 25320114415201 |
11 | 8082222547731 |
12 | 2a0b25b106341 |
13 | 11188a44a1418 |
14 | 6377002d245b |
15 | 2dd97aa83051 |
hex | 17074c6ce661 |
25320114415201 has 2 divisors, whose sum is σ = 25320114415202. Its totient is φ = 25320114415200.
The previous prime is 25320114415177. The next prime is 25320114415291. The reversal of 25320114415201 is 10251441102352.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13486514415201 + 11833600000000 = 3672399^2 + 3440000^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-25320114415201 is a prime.
It is a super-2 number, since 2×253201144152012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (25320114415291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12660057207600 + 12660057207601.
It is an arithmetic number, because the mean of its divisors is an integer number (12660057207601).
Almost surely, 225320114415201 is an apocalyptic number.
It is an amenable number.
25320114415201 is a deficient number, since it is larger than the sum of its proper divisors (1).
25320114415201 is an equidigital number, since it uses as much as digits as its factorization.
25320114415201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 25320114415201 its reverse (10251441102352), we get a palindrome (35571555517553).
The spelling of 25320114415201 in words is "twenty-five trillion, three hundred twenty billion, one hundred fourteen million, four hundred fifteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •