Base | Representation |
---|---|
bin | 1001010101010110… |
… | …11111000000000000 |
3 | 110221020002122210210 |
4 | 10222223133000000 |
5 | 40230304301121 |
6 | 2145123154120 |
7 | 235114610151 |
oct | 45253370000 |
9 | 13836078723 |
10 | 5011009536 |
11 | 21416476a5 |
12 | b7a215940 |
13 | 61b214b00 |
14 | 357729928 |
15 | 1e4dcd876 |
hex | 12aadf000 |
5011009536 has 312 divisors, whose sum is σ = 15349278720. Its totient is φ = 1449197568.
The previous prime is 5011009489. The next prime is 5011009543. The reversal of 5011009536 is 6359001105.
It is a tau number, because it is divible by the number of its divisors (312).
It is a super-2 number, since 2×50110095362 = 50220433139765870592, which contains 22 as substring.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 39456705 + ... + 39456831.
Almost surely, 25011009536 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 5011009536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7674639360).
5011009536 is an abundant number, since it is smaller than the sum of its proper divisors (10338269184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011009536 is a wasteful number, since it uses less digits than its factorization.
5011009536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199 (or 164 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 30.
The square root of 5011009536 is about 70788.4844872385. The cubic root of 5011009536 is about 1711.2300960694.
The spelling of 5011009536 in words is "five billion, eleven million, nine thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •