Base | Representation |
---|---|
bin | 1011111100111010… |
… | …01100110011010000 |
3 | 121120011212120101111 |
4 | 11332131030303100 |
5 | 101120114113440 |
6 | 2540412543104 |
7 | 315002533060 |
oct | 57635146320 |
9 | 17504776344 |
10 | 6416551120 |
11 | 27a2a80911 |
12 | 12b0a81a94 |
13 | 7b3483a15 |
14 | 44c2813a0 |
15 | 2784ba4ea |
hex | 17e74ccd0 |
6416551120 has 160 divisors (see below), whose sum is σ = 17801717760. Its totient is φ = 2104565760.
The previous prime is 6416551103. The next prime is 6416551129. The reversal of 6416551120 is 211556146.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6416551129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1542964 + ... + 1547116.
It is an arithmetic number, because the mean of its divisors is an integer number (111260736).
Almost surely, 26416551120 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6416551120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8900858880).
6416551120 is an abundant number, since it is smaller than the sum of its proper divisors (11385166640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6416551120 is a wasteful number, since it uses less digits than its factorization.
6416551120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4293 (or 4287 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 31.
The square root of 6416551120 is about 80103.3777065612. The cubic root of 6416551120 is about 1858.2346451957.
The spelling of 6416551120 in words is "six billion, four hundred sixteen million, five hundred fifty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •