Base | Representation |
---|---|
bin | 10111110111001000… |
… | …000100101001100011 |
3 | 2110010120021211211011 |
4 | 113313020010221203 |
5 | 404432424100102 |
6 | 15434201201351 |
7 | 1564624161265 |
oct | 276710045143 |
9 | 73116254734 |
10 | 25620925027 |
11 | a958387205 |
12 | 4b70490257 |
13 | 255407a589 |
14 | 1350a19b35 |
15 | 9ee4752d7 |
hex | 5f7204a63 |
25620925027 has 4 divisors (see below), whose sum is σ = 25621251760. Its totient is φ = 25620598296.
The previous prime is 25620925019. The next prime is 25620925037. The reversal of 25620925027 is 72052902652.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a 3-Lehmer number, since φ(25620925027) divides (25620925027-1)3.
It is a cyclic number.
It is not a de Polignac number, because 25620925027 - 23 = 25620925019 is a prime.
It is a deceptive number, since it divides R25620925026.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (25620925037) 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 in 3 ways as a sum of consecutive naturals, for example, 32674 + ... + 228712.
It is an arithmetic number, because the mean of its divisors is an integer number (6405312940).
Almost surely, 225620925027 is an apocalyptic number.
25620925027 is the 130693-rd pentagonal number.
25620925027 is a deficient number, since it is larger than the sum of its proper divisors (326733).
25620925027 is a wasteful number, since it uses less digits than its factorization.
25620925027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326732.
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 25620925027 in words is "twenty-five billion, six hundred twenty million, nine hundred twenty-five thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •