Base | Representation |
---|---|
bin | 10111011000010110… |
… | …100110010100100101 |
3 | 2101210120210210220102 |
4 | 113120112212110211 |
5 | 402403241424034 |
6 | 15311035313445 |
7 | 1546054625063 |
oct | 273026462445 |
9 | 71716723812 |
10 | 25104639269 |
11 | a712a07066 |
12 | 4a475ab885 |
13 | 24a1112848 |
14 | 1302225033 |
15 | 9bde9197e |
hex | 5d85a6525 |
25104639269 has 2 divisors, whose sum is σ = 25104639270. Its totient is φ = 25104639268.
The previous prime is 25104639187. The next prime is 25104639271. The reversal of 25104639269 is 96293640152.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17348314369 + 7756324900 = 131713^2 + 88070^2 .
It is a cyclic number.
It is not a de Polignac number, because 25104639269 - 28 = 25104639013 is a prime.
It is a super-2 number, since 2×251046392692 (a number of 22 digits) contains 22 as substring.
Together with 25104639271, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25106639269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12552319634 + 12552319635.
It is an arithmetic number, because the mean of its divisors is an integer number (12552319635).
Almost surely, 225104639269 is an apocalyptic number.
It is an amenable number.
25104639269 is a deficient number, since it is larger than the sum of its proper divisors (1).
25104639269 is an equidigital number, since it uses as much as digits as its factorization.
25104639269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 47.
The spelling of 25104639269 in words is "twenty-five billion, one hundred four million, six hundred thirty-nine thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •