Base | Representation |
---|---|
bin | 1010110110100000… |
… | …11100110000010000 |
3 | 120001000122202211012 |
4 | 11123100130300100 |
5 | 43412424143112 |
6 | 2402035310052 |
7 | 264242143220 |
oct | 53320346020 |
9 | 16030582735 |
10 | 5826006032 |
11 | 251a6a0620 |
12 | 116714b328 |
13 | 71b018862 |
14 | 3d3a7a080 |
15 | 241719022 |
hex | 15b41cc10 |
5826006032 has 80 divisors (see below), whose sum is σ = 14111096832. Its totient is φ = 2263762560.
The previous prime is 5826005993. The next prime is 5826006037. The reversal of 5826006032 is 2306006285.
It is a self number, because there is not a number n which added to its sum of digits gives 5826006032.
It is not an unprimeable number, because it can be changed into a prime (5826006037) by changing a digit.
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, 465683 + ... + 478029.
Almost surely, 25826006032 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 5826006032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7055548416).
5826006032 is an abundant number, since it is smaller than the sum of its proper divisors (8285090800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5826006032 is a wasteful number, since it uses less digits than its factorization.
5826006032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12756 (or 12750 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 32.
The square root of 5826006032 is about 76328.2780625896. The cubic root of 5826006032 is about 1799.3831252416.
The spelling of 5826006032 in words is "five billion, eight hundred twenty-six million, six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •