Base | Representation |
---|---|
bin | 11000000101010001… |
… | …000100110100110000 |
3 | 2110202002200221100020 |
4 | 120011101010310300 |
5 | 410424142303224 |
6 | 15513514123440 |
7 | 1603534533153 |
oct | 300521046460 |
9 | 73662627306 |
10 | 25858166064 |
11 | aa6a295985 |
12 | 5017a20580 |
13 | 25912736a3 |
14 | 1374333c9a |
15 | a151d8c79 |
hex | 605444d30 |
25858166064 has 160 divisors (see below), whose sum is σ = 71812350144. Its totient is φ = 7989166080.
The previous prime is 25858166063. The next prime is 25858166099. The reversal of 25858166064 is 46066185852.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 25858165998 and 25858166016.
It is not an unprimeable number, because it can be changed into a prime (25858166063) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15951174 + ... + 15952794.
Almost surely, 225858166064 is an apocalyptic number.
25858166064 is a gapful number since it is divisible by the number (24) 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 25858166064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35906175072).
25858166064 is an abundant number, since it is smaller than the sum of its proper divisors (45954184080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
25858166064 is a wasteful number, since it uses less digits than its factorization.
25858166064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1935 (or 1929 counting only the distinct ones).
The product of its (nonzero) digits is 2764800, while the sum is 51.
The spelling of 25858166064 in words is "twenty-five billion, eight hundred fifty-eight million, one hundred sixty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •