Base | Representation |
---|---|
bin | 1001011011010101… |
… | …10000011111101000 |
3 | 111001201110002112210 |
4 | 10231222300133220 |
5 | 40331123310241 |
6 | 2154114005120 |
7 | 236264033250 |
oct | 45552603750 |
9 | 14051402483 |
10 | 5061150696 |
11 | 2167984478 |
12 | b92b767a0 |
13 | 62871c534 |
14 | 36025c960 |
15 | 1e94d5316 |
hex | 12dab07e8 |
5061150696 has 64 divisors (see below), whose sum is σ = 14492292480. Its totient is φ = 1442856960.
The previous prime is 5061150649. The next prime is 5061150719. The reversal of 5061150696 is 6960511605.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 43816 + ... + 109736.
It is an arithmetic number, because the mean of its divisors is an integer number (226442070).
Almost surely, 25061150696 is an apocalyptic number.
5061150696 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5061150696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7246146240).
5061150696 is an abundant number, since it is smaller than the sum of its proper divisors (9431141784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5061150696 is a wasteful number, since it uses less digits than its factorization.
5061150696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66394 (or 66390 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 39.
The square root of 5061150696 is about 71141.7647799097. The cubic root of 5061150696 is about 1716.9188003978.
The spelling of 5061150696 in words is "five billion, sixty-one million, one hundred fifty thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •