Base | Representation |
---|---|
bin | 1110100101010011000… |
… | …00001110110010010100 |
3 | 1202220022201210112202102 |
4 | 13102221200032302110 |
5 | 31202132330130022 |
6 | 1022103410501232 |
7 | 51125506525100 |
oct | 7225140166224 |
9 | 1686281715672 |
10 | 501060005012 |
11 | 1835533459a6 |
12 | 81137b94818 |
13 | 38332937288 |
14 | 1a373d10900 |
15 | d078c18a92 |
hex | 74a980ec94 |
501060005012 has 36 divisors (see below), whose sum is σ = 1044893441844. Its totient is φ = 209502437760.
The previous prime is 501060004987. The next prime is 501060005059. The reversal of 501060005012 is 210500060105.
It can be written as a sum of positive squares in 2 ways, for example, as 121707485956 + 379352519056 = 348866^2 + 615916^2 .
It is a super-2 number, since 2×5010600050122 (a number of 24 digits) 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 (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31167923 + ... + 31183994.
It is an arithmetic number, because the mean of its divisors is an integer number (29024817829).
Almost surely, 2501060005012 is an apocalyptic number.
It is an amenable number.
501060005012 is an abundant number, since it is smaller than the sum of its proper divisors (543833436832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
501060005012 is a wasteful number, since it uses less digits than its factorization.
501060005012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62351976 (or 62351967 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 501060005012 its reverse (210500060105), we get a palindrome (711560065117).
The spelling of 501060005012 in words is "five hundred one billion, sixty million, five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •