Base | Representation |
---|---|
bin | 1110101001011000001… |
… | …00000000101010011111 |
3 | 1210002222101110021120111 |
4 | 13110230010000222133 |
5 | 31221124102004211 |
6 | 1023105015030451 |
7 | 51234005003521 |
oct | 7245404005237 |
9 | 1702871407514 |
10 | 503250422431 |
11 | 18447781aa29 |
12 | 8164966b427 |
13 | 385c1692063 |
14 | 1a500bb5a11 |
15 | d156191421 |
hex | 752c100a9f |
503250422431 has 2 divisors, whose sum is σ = 503250422432. Its totient is φ = 503250422430.
The previous prime is 503250422401. The next prime is 503250422501. The reversal of 503250422431 is 134224052305.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-503250422431 is a prime.
It is a super-2 number, since 2×5032504224312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 503250422393 and 503250422402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (503250422401) by changing a digit.
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 as a sum of consecutive naturals, namely, 251625211215 + 251625211216.
It is an arithmetic number, because the mean of its divisors is an integer number (251625211216).
Almost surely, 2503250422431 is an apocalyptic number.
503250422431 is a deficient number, since it is larger than the sum of its proper divisors (1).
503250422431 is an equidigital number, since it uses as much as digits as its factorization.
503250422431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 503250422431 its reverse (134224052305), we get a palindrome (637474474736).
The spelling of 503250422431 in words is "five hundred three billion, two hundred fifty million, four hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •