Base | Representation |
---|---|
bin | 10111101111011001… |
… | …101000011001000000 |
3 | 2102210112101201121221 |
4 | 113233121220121000 |
5 | 404201233411034 |
6 | 15413251124424 |
7 | 1561461363316 |
oct | 275731503100 |
9 | 72715351557 |
10 | 25491310144 |
11 | a8a11a8673 |
12 | 4b34ba3714 |
13 | 2533268191 |
14 | 133b71a0b6 |
15 | 9e2dc0bb4 |
hex | 5ef668640 |
25491310144 has 56 divisors (see below), whose sum is σ = 54080103168. Its totient is φ = 11879393280.
The previous prime is 25491310133. The next prime is 25491310153. The reversal of 25491310144 is 44101319452.
It is a Harshad number since it is a multiple of its sum of digits (34).
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 7 ways as a sum of consecutive naturals, for example, 1672 + ... + 225799.
It is an arithmetic number, because the mean of its divisors is an integer number (965716128).
Almost surely, 225491310144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25491310144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27040051584).
25491310144 is an abundant number, since it is smaller than the sum of its proper divisors (28588793024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25491310144 is a wasteful number, since it uses less digits than its factorization.
25491310144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227603 (or 227593 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 34.
Adding to 25491310144 its reverse (44101319452), we get a palindrome (69592629596).
The spelling of 25491310144 in words is "twenty-five billion, four hundred ninety-one million, three hundred ten thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •