Base | Representation |
---|---|
bin | 10111011000101100… |
… | …101011101000000000 |
3 | 2101210222200220202210 |
4 | 113120230223220000 |
5 | 402411232200120 |
6 | 15311403342120 |
7 | 1546155055236 |
oct | 273054535000 |
9 | 71728626683 |
10 | 25110428160 |
11 | a716200374 |
12 | 4a49521940 |
13 | 24a238b71c |
14 | 1302cd0956 |
15 | 9be736ce0 |
hex | 5d8b2ba00 |
25110428160 has 160 divisors (see below), whose sum is σ = 80556094080. Its totient is φ = 6672662528.
The previous prime is 25110428137. The next prime is 25110428179. The reversal of 25110428160 is 6182401152.
It is a tau number, because it is divible by the number of its divisors (160).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2244661 + ... + 2255819.
It is an arithmetic number, because the mean of its divisors is an integer number (503475588).
Almost surely, 225110428160 is an apocalyptic number.
25110428160 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 25110428160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40278047040).
25110428160 is an abundant number, since it is smaller than the sum of its proper divisors (55445665920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25110428160 is a wasteful number, since it uses less digits than its factorization.
25110428160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11478 (or 11462 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 30.
The spelling of 25110428160 in words is "twenty-five billion, one hundred ten million, four hundred twenty-eight thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •