Base | Representation |
---|---|
bin | 10111010010000111… |
… | …011011101000110011 |
3 | 2101112021220120212211 |
4 | 113102013123220303 |
5 | 402200000000201 |
6 | 15252420432551 |
7 | 1543344331345 |
oct | 272207335063 |
9 | 71467816784 |
10 | 25000000051 |
11 | a669937074 |
12 | 4a18548757 |
13 | 2485536550 |
14 | 12d2387295 |
15 | 9b4bc2651 |
hex | 5d21dba33 |
25000000051 has 8 divisors (see below), whose sum is σ = 26929036064. Its totient is φ = 23071815360.
The previous prime is 25000000021. The next prime is 25000000111. The reversal of 25000000051 is 15000000052.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 25000000051 - 225 = 24966445619 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 24999999968 and 25000000040.
It is not an unprimeable number, because it can be changed into a prime (25000000021) 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 in 7 ways as a sum of consecutive naturals, for example, 151170 + ... + 269911.
It is an arithmetic number, because the mean of its divisors is an integer number (3366129508).
Almost surely, 225000000051 is an apocalyptic number.
25000000051 is a deficient number, since it is larger than the sum of its proper divisors (1929036013).
25000000051 is a wasteful number, since it uses less digits than its factorization.
25000000051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425661.
The product of its (nonzero) digits is 50, while the sum is 13.
Subtracting from 25000000051 its reverse (15000000052), we obtain a palindrome (9999999999).
The spelling of 25000000051 in words is "twenty-five billion, fifty-one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •