Base | Representation |
---|---|
bin | 1010101101000110… |
… | …10100000010000000 |
3 | 112211112010011000210 |
4 | 11112203110002000 |
5 | 43232222034320 |
6 | 2350135314120 |
7 | 262263150300 |
oct | 52643240200 |
9 | 15745104023 |
10 | 5747064960 |
11 | 248a082a6a |
12 | 114481b940 |
13 | 707869470 |
14 | 3c73ab600 |
15 | 2398240e0 |
hex | 1568d4080 |
5747064960 has 768 divisors, whose sum is σ = 23754608640. Its totient is φ = 1170505728.
The previous prime is 5747064943. The next prime is 5747064989. The reversal of 5747064960 is 694607475.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 45252417 + ... + 45252543.
It is an arithmetic number, because the mean of its divisors is an integer number (30930480).
Almost surely, 25747064960 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 5747064960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11877304320).
5747064960 is an abundant number, since it is smaller than the sum of its proper divisors (18007543680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5747064960 is a wasteful number, since it uses less digits than its factorization.
5747064960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213 (or 194 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 48.
The square root of 5747064960 is about 75809.3988895836. The cubic root of 5747064960 is about 1791.2190607640.
The spelling of 5747064960 in words is "five billion, seven hundred forty-seven million, sixty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •