Base | Representation |
---|---|
bin | 11000001001011111… |
… | …011111011111001101 |
3 | 2110221001002102112011 |
4 | 120021133133133031 |
5 | 411100314213112 |
6 | 15524525341221 |
7 | 1605355216036 |
oct | 301137373715 |
9 | 73831072464 |
10 | 25929054157 |
11 | aaa6303186 |
12 | 5037707811 |
13 | 25a2b634c6 |
14 | 137d907a8d |
15 | a1b53caa7 |
hex | 6097df7cd |
25929054157 has 4 divisors (see below), whose sum is σ = 25982297056. Its totient is φ = 25875811260.
The previous prime is 25929054133. The next prime is 25929054181. The reversal of 25929054157 is 75145092952.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (25929054133) and next prime (25929054181).
It is a cyclic number.
It is not a de Polignac number, because 25929054157 - 211 = 25929052109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 25929054157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25929058157) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26620719 + ... + 26621692.
It is an arithmetic number, because the mean of its divisors is an integer number (6495574264).
Almost surely, 225929054157 is an apocalyptic number.
It is an amenable number.
25929054157 is a deficient number, since it is larger than the sum of its proper divisors (53242899).
25929054157 is an equidigital number, since it uses as much as digits as its factorization.
25929054157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53242898.
The product of its (nonzero) digits is 1134000, while the sum is 49.
The spelling of 25929054157 in words is "twenty-five billion, nine hundred twenty-nine million, fifty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •