Base | Representation |
---|---|
bin | 1001101010100110… |
… | …01010010000000000 |
3 | 111101122100210010010 |
4 | 10311103022100000 |
5 | 41111412314324 |
6 | 2214530104520 |
7 | 242410215564 |
oct | 46523122000 |
9 | 14348323103 |
10 | 5189182464 |
11 | 2223181654 |
12 | 1009a1b140 |
13 | 6490c918b |
14 | 3732696a4 |
15 | 205875829 |
hex | 1354ca400 |
5189182464 has 88 divisors (see below), whose sum is σ = 13858157248. Its totient is φ = 1726341120.
The previous prime is 5189182457. The next prime is 5189182477. The reversal of 5189182464 is 4642819815.
It is a super-2 number, since 2×51891824642 = 53855229289370222592, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
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 7 ways as a sum of consecutive naturals, for example, 1937094 + ... + 1939770.
Almost surely, 25189182464 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 5189182464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6929078624).
5189182464 is an abundant number, since it is smaller than the sum of its proper divisors (8668974784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5189182464 is a wasteful number, since it uses less digits than its factorization.
5189182464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3331 (or 3313 counting only the distinct ones).
The product of its digits is 552960, while the sum is 48.
The square root of 5189182464 is about 72035.9803431591. The cubic root of 5189182464 is about 1731.2760211844.
The spelling of 5189182464 in words is "five billion, one hundred eighty-nine million, one hundred eighty-two thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •