Base | Representation |
---|---|
bin | 1011000010100110… |
… | …01001011100100000 |
3 | 120022002101221012100 |
4 | 11201103021130200 |
5 | 44114402023142 |
6 | 2420100130400 |
7 | 266612604360 |
oct | 54123113440 |
9 | 16262357170 |
10 | 5927376672 |
11 | 2571938908 |
12 | 1195096a00 |
13 | 73601c199 |
14 | 4033069a0 |
15 | 24a58eb4c |
hex | 1614c9720 |
5927376672 has 288 divisors, whose sum is σ = 20618986752. Its totient is φ = 1576599552.
The previous prime is 5927376661. The next prime is 5927376773. The reversal of 5927376672 is 2766737295.
It is a tau number, because it is divible by the number of its divisors (288).
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 47 ways as a sum of consecutive naturals, for example, 3323493 + ... + 3325275.
It is an arithmetic number, because the mean of its divisors is an integer number (71593704).
Almost surely, 25927376672 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 5927376672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10309493376).
5927376672 is an abundant number, since it is smaller than the sum of its proper divisors (14691610080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5927376672 is a wasteful number, since it uses less digits than its factorization.
5927376672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1920 (or 1909 counting only the distinct ones).
The product of its digits is 6667920, while the sum is 54.
The square root of 5927376672 is about 76989.4581874688. The cubic root of 5927376672 is about 1809.7594047488.
The spelling of 5927376672 in words is "five billion, nine hundred twenty-seven million, three hundred seventy-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •