Base | Representation |
---|---|
bin | 1010111101110010… |
… | …00110011001110000 |
3 | 120012021102021122000 |
4 | 11132321012121300 |
5 | 44024032302112 |
6 | 2412054414000 |
7 | 265612423623 |
oct | 53671063160 |
9 | 16167367560 |
10 | 5886994032 |
11 | 2551066827 |
12 | 1183661300 |
13 | 72a85042a |
14 | 3dbbd3dba |
15 | 246c647dc |
hex | 15ee46670 |
5886994032 has 40 divisors (see below), whose sum is σ = 16897854480. Its totient is φ = 1962331200.
The previous prime is 5886994019. The next prime is 5886994033. The reversal of 5886994032 is 2304996885.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 5886994032.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5886994033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6813219 + ... + 6814082.
It is an arithmetic number, because the mean of its divisors is an integer number (422446362).
Almost surely, 25886994032 is an apocalyptic number.
It is an amenable number.
5886994032 is an abundant number, since it is smaller than the sum of its proper divisors (11010860448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5886994032 is a wasteful number, since it uses less digits than its factorization.
5886994032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13627318 (or 13627306 counting only the distinct ones).
The product of its (nonzero) digits is 3732480, while the sum is 54.
The square root of 5886994032 is about 76726.7491296223. The cubic root of 5886994032 is about 1805.6401309429.
The spelling of 5886994032 in words is "five billion, eight hundred eighty-six million, nine hundred ninety-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.231 sec. • engine limits •