Base | Representation |
---|---|
bin | 1110100101110011011… |
… | …11101110011001100001 |
3 | 1202221000201112211111122 |
4 | 13102321233232121201 |
5 | 31203212110031423 |
6 | 1022150423222025 |
7 | 51135325646222 |
oct | 7227157563141 |
9 | 1687021484448 |
10 | 501332502113 |
11 | 183683145013 |
12 | 811b32a7915 |
13 | 38377225871 |
14 | 1a39c1a5249 |
15 | d092ae38c8 |
hex | 74b9bee661 |
501332502113 has 2 divisors, whose sum is σ = 501332502114. Its totient is φ = 501332502112.
The previous prime is 501332502017. The next prime is 501332502133. The reversal of 501332502113 is 311205233105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 454448560384 + 46883941729 = 674128^2 + 216527^2 .
It is a cyclic number.
It is not a de Polignac number, because 501332502113 - 214 = 501332485729 is a prime.
It is a super-2 number, since 2×5013325021132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (501332502133) by changing a digit.
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 as a sum of consecutive naturals, namely, 250666251056 + 250666251057.
It is an arithmetic number, because the mean of its divisors is an integer number (250666251057).
Almost surely, 2501332502113 is an apocalyptic number.
It is an amenable number.
501332502113 is a deficient number, since it is larger than the sum of its proper divisors (1).
501332502113 is an equidigital number, since it uses as much as digits as its factorization.
501332502113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 501332502113 its reverse (311205233105), we get a palindrome (812537735218).
The spelling of 501332502113 in words is "five hundred one billion, three hundred thirty-two million, five hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •