Base | Representation |
---|---|
bin | 1011111101011011… |
… | …11101111010000000 |
3 | 121120111010212210120 |
4 | 11332231331322000 |
5 | 101122230242220 |
6 | 2541051100240 |
7 | 315055100550 |
oct | 57655757200 |
9 | 17514125716 |
10 | 6420946560 |
11 | 27a5503206 |
12 | 12b2441680 |
13 | 7b4362582 |
14 | 44caa7160 |
15 | 278a87a40 |
hex | 17eb7de80 |
6420946560 has 256 divisors, whose sum is σ = 23458498560. Its totient is φ = 1463390208.
The previous prime is 6420946523. The next prime is 6420946601. The reversal of 6420946560 is 656490246.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8641549 + ... + 8642291.
It is an arithmetic number, because the mean of its divisors is an integer number (91634760).
Almost surely, 26420946560 is an apocalyptic number.
6420946560 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 6420946560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11729249280).
6420946560 is an abundant number, since it is smaller than the sum of its proper divisors (17037552000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6420946560 is a wasteful number, since it uses less digits than its factorization.
6420946560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1415 (or 1403 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 42.
The square root of 6420946560 is about 80130.8090561926. The cubic root of 6420946560 is about 1858.6588551505.
The spelling of 6420946560 in words is "six billion, four hundred twenty million, nine hundred forty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •