Base | Representation |
---|---|
bin | 10111101011010000… |
… | …011000000001010000 |
3 | 2102121200112222020120 |
4 | 113223100120001100 |
5 | 404030433244203 |
6 | 15402324510240 |
7 | 1556655343614 |
oct | 275320300120 |
9 | 72550488216 |
10 | 25421774928 |
11 | a865a24850 |
12 | 4b1584b380 |
13 | 2521a30094 |
14 | 13323b9344 |
15 | 9dbc37b53 |
hex | 5eb418050 |
25421774928 has 160 divisors (see below), whose sum is σ = 72859336704. Its totient is φ = 7573440000.
The previous prime is 25421774927. The next prime is 25421774933. The reversal of 25421774928 is 82947712452.
It is a happy number.
It is a super-3 number, since 3×254217749283 (a number of 32 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25421774927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17281233 + ... + 17282703.
Almost surely, 225421774928 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 25421774928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (36429668352).
25421774928 is an abundant number, since it is smaller than the sum of its proper divisors (47437561776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25421774928 is a wasteful number, since it uses less digits than its factorization.
25421774928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2025 (or 2019 counting only the distinct ones).
The product of its digits is 2257920, while the sum is 51.
The spelling of 25421774928 in words is "twenty-five billion, four hundred twenty-one million, seven hundred seventy-four thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •