Base | Representation |
---|---|
bin | 1011001000011110… |
… | …01110101000000000 |
3 | 120102112011211222002 |
4 | 11210033032220000 |
5 | 44220012242320 |
6 | 2425021003132 |
7 | 301051643555 |
oct | 54417165000 |
9 | 16375154862 |
10 | 5976680960 |
11 | 2597753958 |
12 | 11a96b34a8 |
13 | 7432c2a13 |
14 | 409a9ca2c |
15 | 24ea7d675 |
hex | 1643cea00 |
5976680960 has 160 divisors (see below), whose sum is σ = 14933901312. Its totient is φ = 2291466240.
The previous prime is 5976680951. The next prime is 5976680971. The reversal of 5976680960 is 690866795.
It is a tau number, because it is divible by the number of its divisors (160).
It is a junction number, because it is equal to n+sod(n) for n = 5976680896 and 5976680905.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10078424 + ... + 10079016.
Almost surely, 25976680960 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 5976680960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7466950656).
5976680960 is an abundant number, since it is smaller than the sum of its proper divisors (8957220352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5976680960 is a wasteful number, since it uses less digits than its factorization.
5976680960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774 (or 758 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 56.
The square root of 5976680960 is about 77308.9966304052. The cubic root of 5976680960 is about 1814.7634527434.
The spelling of 5976680960 in words is "five billion, nine hundred seventy-six million, six hundred eighty thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •