Base | Representation |
---|---|
bin | 1110100101011111000… |
… | …01100000111111111010 |
3 | 1202220120202211212202120 |
4 | 13102233201200333322 |
5 | 31202334204130200 |
6 | 1022121415342110 |
7 | 51131144153616 |
oct | 7225741407772 |
9 | 1686522755676 |
10 | 501161005050 |
11 | 1835a535a802 |
12 | 81165981936 |
13 | 3834a83b004 |
14 | 1a3834c2346 |
15 | d082a199a0 |
hex | 74af860ffa |
501161005050 has 48 divisors (see below), whose sum is σ = 1243468841472. Its totient is φ = 133579542400.
The previous prime is 501161005039. The next prime is 501161005097. The reversal of 501161005050 is 50500161105.
It is a super-2 number, since 2×5011610050502 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 501161005050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 474699 + ... + 1107998.
It is an arithmetic number, because the mean of its divisors is an integer number (25905600864).
Almost surely, 2501161005050 is an apocalyptic number.
501161005050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
501161005050 is an abundant number, since it is smaller than the sum of its proper divisors (742307836422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501161005050 is a wasteful number, since it uses less digits than its factorization.
501161005050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1584823 (or 1584818 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 501161005050 its reverse (50500161105), we get a palindrome (551661166155).
The spelling of 501161005050 in words is "five hundred one billion, one hundred sixty-one million, five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •