Base | Representation |
---|---|
bin | 1010110110100000… |
… | …00110001110010000 |
3 | 120001000111002020010 |
4 | 11123100012032100 |
5 | 43412413214434 |
6 | 2402033314520 |
7 | 264241310160 |
oct | 53320061620 |
9 | 16030432203 |
10 | 5825913744 |
11 | 251a638252 |
12 | 1167105a40 |
13 | 71acb5851 |
14 | 3d3a545a0 |
15 | 2416eb9e9 |
hex | 15b406390 |
5825913744 has 160 divisors (see below), whose sum is σ = 17507736576. Its totient is φ = 1635079680.
The previous prime is 5825913739. The next prime is 5825913757. The reversal of 5825913744 is 4473195285.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 5825913693 and 5825913702.
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 31 ways as a sum of consecutive naturals, for example, 4709094 + ... + 4710330.
Almost surely, 25825913744 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 5825913744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8753868288).
5825913744 is an abundant number, since it is smaller than the sum of its proper divisors (11681822832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5825913744 is a wasteful number, since it uses less digits than its factorization.
5825913744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493 (or 1487 counting only the distinct ones).
The product of its digits is 1209600, while the sum is 48.
The square root of 5825913744 is about 76327.6735136084. The cubic root of 5825913744 is about 1799.3736240301.
The spelling of 5825913744 in words is "five billion, eight hundred twenty-five million, nine hundred thirteen thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •