Base | Representation |
---|---|
bin | 10111110010111010… |
… | …100010111100000000 |
3 | 2102221122100012122000 |
4 | 113302322202330000 |
5 | 404311332121313 |
6 | 15423154544000 |
7 | 1563105466461 |
oct | 276272427400 |
9 | 72848305560 |
10 | 25550270208 |
11 | a9215091a1 |
12 | 4b50898000 |
13 | 254253c9a8 |
14 | 13454a6d68 |
15 | 9e816a673 |
hex | 5f2ea2f00 |
25550270208 has 144 divisors (see below), whose sum is σ = 75919065600. Its totient is φ = 8475909120.
The previous prime is 25550270167. The next prime is 25550270209. The reversal of 25550270208 is 80207205552.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (25550270209) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1449673 + ... + 1467191.
Almost surely, 225550270208 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 25550270208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37959532800).
25550270208 is an abundant number, since it is smaller than the sum of its proper divisors (50368795392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25550270208 is a wasteful number, since it uses less digits than its factorization.
25550270208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17755 (or 17735 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 36.
The spelling of 25550270208 in words is "twenty-five billion, five hundred fifty million, two hundred seventy thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •