Base | Representation |
---|---|
bin | 1110100101110000111… |
… | …10001000011110010001 |
3 | 1202220222020022011022011 |
4 | 13102320132020132101 |
5 | 31203141121104410 |
6 | 1022144340542521 |
7 | 51134646103465 |
oct | 7227036103621 |
9 | 1686866264264 |
10 | 501311113105 |
11 | 183672066150 |
12 | 811a80b1a41 |
13 | 3837297714a |
14 | 1a3993d84a5 |
15 | d090cbb18a |
hex | 74b8788791 |
501311113105 has 16 divisors (see below), whose sum is σ = 656433310464. Its totient is φ = 364494628480.
The previous prime is 501311113081. The next prime is 501311113129.
501311113105 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (501311113081) and next prime (501311113129).
It is a de Polignac number, because none of the positive numbers 2k-501311113105 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 978169 + ... + 1399798.
It is an arithmetic number, because the mean of its divisors is an integer number (41027081904).
Almost surely, 2501311113105 is an apocalyptic number.
501311113105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
501311113105 is a deficient number, since it is larger than the sum of its proper divisors (155122197359).
501311113105 is a wasteful number, since it uses less digits than its factorization.
501311113105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2381816.
The product of its (nonzero) digits is 225, while the sum is 22.
It can be divided in two parts, 501311 and 113105, that added together give a palindrome (614416).
The spelling of 501311113105 in words is "five hundred one billion, three hundred eleven million, one hundred thirteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •