Base | Representation |
---|---|
bin | 1110101001000001110… |
… | …01111100011001010011 |
3 | 1210002111100020010111111 |
4 | 13110200321330121103 |
5 | 31220233141443011 |
6 | 1023034250554151 |
7 | 51226242636163 |
oct | 7244071743123 |
9 | 1702440203444 |
10 | 503063234131 |
11 | 184391098657 |
12 | 815b6a38957 |
13 | 38591972353 |
14 | 1a4c3daa5a3 |
15 | d144a18121 |
hex | 7520e7c653 |
503063234131 has 4 divisors (see below), whose sum is σ = 503671533912. Its totient is φ = 502454934352.
The previous prime is 503063234119. The next prime is 503063234159. The reversal of 503063234131 is 131432360305.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-503063234131 is a prime.
It is a super-2 number, since 2×5030632341312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 503063234093 and 503063234102.
It is not an unprimeable number, because it can be changed into a prime (503063234101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 304148650 + ... + 304150303.
It is an arithmetic number, because the mean of its divisors is an integer number (125917883478).
Almost surely, 2503063234131 is an apocalyptic number.
503063234131 is a deficient number, since it is larger than the sum of its proper divisors (608299781).
503063234131 is an equidigital number, since it uses as much as digits as its factorization.
503063234131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 608299780.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 503063234131 its reverse (131432360305), we get a palindrome (634495594436).
The spelling of 503063234131 in words is "five hundred three billion, sixty-three million, two hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •