Base | Representation |
---|---|
bin | 1001110001110111… |
… | …0101000000000000 |
3 | 20202221112010011011 |
4 | 2130131311000000 |
5 | 20334004034320 |
6 | 1112252130304 |
7 | 122023453420 |
oct | 23435650000 |
9 | 6687463134 |
10 | 2625064960 |
11 | 1127865181 |
12 | 613166994 |
13 | 32ab0a89b |
14 | 1ac8c8480 |
15 | 1056d205a |
hex | 9c775000 |
2625064960 has 104 divisors (see below), whose sum is σ = 7199692416. Its totient is φ = 899973120.
The previous prime is 2625064943. The next prime is 2625064961. The reversal of 2625064960 is 694605262.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2625064961) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 134205 + ... + 152515.
Almost surely, 22625064960 is an apocalyptic number.
2625064960 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 2625064960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3599846208).
2625064960 is an abundant number, since it is smaller than the sum of its proper divisors (4574627456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2625064960 is an equidigital number, since it uses as much as digits as its factorization.
2625064960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18347 (or 18325 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 40.
The square root of 2625064960 is about 51235.3877705634. The cubic root of 2625064960 is about 1379.4734671262.
The spelling of 2625064960 in words is "two billion, six hundred twenty-five million, sixty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •