Base | Representation |
---|---|
bin | 100111100001011… |
… | …100110001101000 |
3 | 1201012200221211000 |
4 | 213201130301220 |
5 | 2324222030130 |
6 | 145444035000 |
7 | 22301041650 |
oct | 4741346150 |
9 | 1635627730 |
10 | 663080040 |
11 | 310322937 |
12 | 166092a60 |
13 | a74b376c |
14 | 640c7360 |
15 | 3d32d260 |
hex | 2785cc68 |
663080040 has 256 divisors, whose sum is σ = 2548224000. Its totient is φ = 150232320.
The previous prime is 663080023. The next prime is 663080051. The reversal of 663080040 is 40080366.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 663079986 and 663080013.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1050525 + ... + 1051155.
It is an arithmetic number, because the mean of its divisors is an integer number (9954000).
Almost surely, 2663080040 is an apocalyptic number.
663080040 is a gapful number since it is divisible by the number (60) 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 663080040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1274112000).
663080040 is an abundant number, since it is smaller than the sum of its proper divisors (1885143960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
663080040 is a wasteful number, since it uses less digits than its factorization.
663080040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 797 (or 787 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The square root of 663080040 is about 25750.3405802719. The cubic root of 663080040 is about 872.0110434031.
The spelling of 663080040 in words is "six hundred sixty-three million, eighty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •