Base | Representation |
---|---|
bin | 1000101110001011… |
… | …11110001011000000 |
3 | 110002022210000010020 |
4 | 10113011332023000 |
5 | 34042144034030 |
6 | 2052344133440 |
7 | 224014550100 |
oct | 42705761300 |
9 | 13068700106 |
10 | 4682408640 |
11 | 1a93108a08 |
12 | aa8167280 |
13 | 598111b00 |
14 | 325c2d200 |
15 | 1c6120510 |
hex | 11717e2c0 |
4682408640 has 1008 divisors, whose sum is σ = 20347960320. Its totient is φ = 905748480.
The previous prime is 4682408561. The next prime is 4682408669. The reversal of 4682408640 is 468042864.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 4682408592 and 4682408601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 151045425 + ... + 151045455.
Almost surely, 24682408640 is an apocalyptic number.
4682408640 is a gapful number since it is divisible by the number (40) 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 4682408640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10173980160).
4682408640 is an abundant number, since it is smaller than the sum of its proper divisors (15665551680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4682408640 is a wasteful number, since it uses less digits than its factorization.
4682408640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110 (or 80 counting only the distinct ones).
The product of its (nonzero) digits is 294912, while the sum is 42.
The square root of 4682408640 is about 68428.1275500068. The cubic root of 4682408640 is about 1672.9762314043.
The spelling of 4682408640 in words is "four billion, six hundred eighty-two million, four hundred eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •