Base | Representation |
---|---|
bin | 10111011010011110… |
… | …011100101000111101 |
3 | 2101220001211002021201 |
4 | 113122132130220331 |
5 | 402441401014242 |
6 | 15314350455501 |
7 | 1546666415665 |
oct | 273236345075 |
9 | 71801732251 |
10 | 25140251197 |
11 | a73101a906 |
12 | 4a57504591 |
13 | 24a8600ca9 |
14 | 1306c551a5 |
15 | 9c21784b7 |
hex | 5da79ca3d |
25140251197 has 2 divisors, whose sum is σ = 25140251198. Its totient is φ = 25140251196.
The previous prime is 25140251179. The next prime is 25140251203. The reversal of 25140251197 is 79115204152.
Together with previous prime (25140251179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25082323876 + 57927321 = 158374^2 + 7611^2 .
It is a cyclic number.
It is not a de Polignac number, because 25140251197 - 27 = 25140251069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (25140251107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 12570125598 + 12570125599.
It is an arithmetic number, because the mean of its divisors is an integer number (12570125599).
Almost surely, 225140251197 is an apocalyptic number.
It is an amenable number.
25140251197 is a deficient number, since it is larger than the sum of its proper divisors (1).
25140251197 is an equidigital number, since it uses as much as digits as its factorization.
25140251197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 37.
The spelling of 25140251197 in words is "twenty-five billion, one hundred forty million, two hundred fifty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •