Base | Representation |
---|---|
bin | 10111010010110110… |
… | …001011100100011101 |
3 | 2101120010222012112000 |
4 | 113102312023210131 |
5 | 402211114130010 |
6 | 15253535232513 |
7 | 1543553442153 |
oct | 272266134435 |
9 | 71503865460 |
10 | 25012255005 |
11 | a675847431 |
12 | 4a20678739 |
13 | 2487c375ba |
14 | 12d3c573d3 |
15 | 9b5ce37c0 |
hex | 5d2d8b91d |
25012255005 has 32 divisors (see below), whose sum is σ = 44489934720. Its totient is φ = 13332758400.
The previous prime is 25012254983. The next prime is 25012255019. The reversal of 25012255005 is 50055221052.
It is not a de Polignac number, because 25012255005 - 26 = 25012254941 is a prime.
It is a super-2 number, since 2×250122550052 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 25012255005.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 209830 + ... + 306680.
It is an arithmetic number, because the mean of its divisors is an integer number (1390310460).
Almost surely, 225012255005 is an apocalyptic number.
It is an amenable number.
25012255005 is a deficient number, since it is larger than the sum of its proper divisors (19477679715).
25012255005 is a wasteful number, since it uses less digits than its factorization.
25012255005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98778 (or 98772 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
Adding to 25012255005 its reverse (50055221052), we get a palindrome (75067476057).
The spelling of 25012255005 in words is "twenty-five billion, twelve million, two hundred fifty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •