Base | Representation |
---|---|
bin | 10111110010101010… |
… | …110001110001001000 |
3 | 2102221100120012110012 |
4 | 113302222301301020 |
5 | 404304302333043 |
6 | 15422530211052 |
7 | 1563025402334 |
oct | 276252616110 |
9 | 72840505405 |
10 | 25546136648 |
11 | a91a14562a |
12 | 4b4b423a88 |
13 | 25417233b6 |
14 | 1344b0c7c4 |
15 | 9e7b00a18 |
hex | 5f2ab1c48 |
25546136648 has 12 divisors (see below), whose sum is σ = 47899853865. Its totient is φ = 12772842288.
The previous prime is 25546136573. The next prime is 25546136711. The reversal of 25546136648 is 84663164552.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 25471521604 + 74615044 = 159598^2 + 8638^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=113018.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 25546136596 and 25546136605.
It is an unprimeable number.
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 2 ways as a sum of consecutive naturals, for example, 423818 + ... + 480326.
Almost surely, 225546136648 is an apocalyptic number.
It is an amenable number.
25546136648 is a deficient number, since it is larger than the sum of its proper divisors (22353717217).
25546136648 is an frugal number, since it uses more digits than its factorization.
25546136648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113024 (or 56511 counting only the distinct ones).
The product of its digits is 4147200, while the sum is 50.
Multiplying 25546136648 by its sum of digits (50), we get a square (1277306832400 = 11301802).
The spelling of 25546136648 in words is "twenty-five billion, five hundred forty-six million, one hundred thirty-six thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •