Base | Representation |
---|---|
bin | 10111111011001100… |
… | …111100101100000001 |
3 | 2110022022222021010001 |
4 | 113323030330230001 |
5 | 410102430441001 |
6 | 15445043040001 |
7 | 1566414356233 |
oct | 277314745401 |
9 | 73268867101 |
10 | 25689312001 |
11 | a992a46371 |
12 | 4b8b370001 |
13 | 25652a2b42 |
14 | 1359b3c253 |
15 | a05483001 |
hex | 5fb33cb01 |
25689312001 has 2 divisors, whose sum is σ = 25689312002. Its totient is φ = 25689312000.
The previous prime is 25689311957. The next prime is 25689312013. The reversal of 25689312001 is 10021398652.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14490381376 + 11198930625 = 120376^2 + 105825^2 .
It is a cyclic number.
It is not a de Polignac number, because 25689312001 - 215 = 25689279233 is a prime.
It is not a weakly prime, because it can be changed into another prime (25689312041) 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, 12844656000 + 12844656001.
It is an arithmetic number, because the mean of its divisors is an integer number (12844656001).
Almost surely, 225689312001 is an apocalyptic number.
It is an amenable number.
25689312001 is a deficient number, since it is larger than the sum of its proper divisors (1).
25689312001 is an equidigital number, since it uses as much as digits as its factorization.
25689312001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 25689312001 in words is "twenty-five billion, six hundred eighty-nine million, three hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •