Base | Representation |
---|---|
bin | 1001011011010110… |
… | …00101010110111000 |
3 | 111001201121102202211 |
4 | 10231223011112320 |
5 | 40331134024102 |
6 | 2154115504504 |
7 | 236264540350 |
oct | 45553052670 |
9 | 14051542684 |
10 | 5061236152 |
11 | 2167a326a5 |
12 | b92bb8134 |
13 | 62874c3bb |
14 | 360281b60 |
15 | 1e95007d7 |
hex | 12dac55b8 |
5061236152 has 32 divisors (see below), whose sum is σ = 10848182400. Its totient is φ = 2168565984.
The previous prime is 5061236083. The next prime is 5061236153. The reversal of 5061236152 is 2516321605.
It is a super-2 number, since 2×50612361522 = 51232222772623534208, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5061236153) 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, 289599 + ... + 306577.
It is an arithmetic number, because the mean of its divisors is an integer number (339005700).
Almost surely, 25061236152 is an apocalyptic number.
It is an amenable number.
5061236152 is an abundant number, since it is smaller than the sum of its proper divisors (5786946248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5061236152 is a wasteful number, since it uses less digits than its factorization.
5061236152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22315 (or 22311 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The square root of 5061236152 is about 71142.3653809739. The cubic root of 5061236152 is about 1716.9284635618.
Adding to 5061236152 its reverse (2516321605), we get a palindrome (7577557757).
The spelling of 5061236152 in words is "five billion, sixty-one million, two hundred thirty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •