Base | Representation |
---|---|
bin | 1011111110001111… |
… | …00110100010000000 |
3 | 121120221210021220110 |
4 | 11333013212202000 |
5 | 101130440312220 |
6 | 2541451111320 |
7 | 315166156440 |
oct | 57707464200 |
9 | 17527707813 |
10 | 6427666560 |
11 | 27a9283027 |
12 | 12b4742540 |
13 | 7b58761c3 |
14 | 44d936120 |
15 | 279463be0 |
hex | 17f1e6880 |
6427666560 has 256 divisors, whose sum is σ = 24648422400. Its totient is φ = 1391800320.
The previous prime is 6427666547. The next prime is 6427666627. The reversal of 6427666560 is 656667246.
It is a Harshad number since it is a multiple of its sum of digits (48).
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, 242775 + ... + 267945.
It is an arithmetic number, because the mean of its divisors is an integer number (96282900).
Almost surely, 26427666560 is an apocalyptic number.
6427666560 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 6427666560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12324211200).
6427666560 is an abundant number, since it is smaller than the sum of its proper divisors (18220755840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6427666560 is a wasteful number, since it uses less digits than its factorization.
6427666560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25219 (or 25207 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 48.
The square root of 6427666560 is about 80172.7295281881. The cubic root of 6427666560 is about 1859.3070375027.
The spelling of 6427666560 in words is "six billion, four hundred twenty-seven million, six hundred sixty-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •