Base | Representation |
---|---|
bin | 1001010101010011… |
… | …00010110110111010 |
3 | 110221012010211021222 |
4 | 10222221202312322 |
5 | 40230142013200 |
6 | 2145104232042 |
7 | 235110361532 |
oct | 45251426672 |
9 | 13835124258 |
10 | 5010501050 |
11 | 214132a665 |
12 | b7a00b622 |
13 | 61b097529 |
14 | 3576364c2 |
15 | 1e4d2cd85 |
hex | 12aa62dba |
5010501050 has 48 divisors (see below), whose sum is σ = 9434630520. Its totient is φ = 1979535360.
The previous prime is 5010501047. The next prime is 5010501061. The reversal of 5010501050 is 501050105.
It can be written as a sum of positive squares in 12 ways, for example, as 1241646169 + 3768854881 = 35237^2 + 61391^2 .
It is a super-5 number, since 5×50105010505 (a number of 50 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is an alternating number because its digits alternate between odd and even.
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 23 ways as a sum of consecutive naturals, for example, 3923012 + ... + 3924288.
Almost surely, 25010501050 is an apocalyptic number.
5010501050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5010501050 is a deficient number, since it is larger than the sum of its proper divisors (4424129470).
5010501050 is a wasteful number, since it uses less digits than its factorization.
5010501050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2195 (or 2190 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 17.
The square root of 5010501050 is about 70784.8928091298. The cubic root of 5010501050 is about 1711.1722124583.
Adding to 5010501050 its reverse (501050105), we get a palindrome (5511551155).
The spelling of 5010501050 in words is "five billion, ten million, five hundred one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •