Base | Representation |
---|---|
bin | 1110101101000000100… |
… | …10100111111100111111 |
3 | 1210022000021200221020021 |
4 | 13112200102213330333 |
5 | 31234122301113211 |
6 | 1024030314033011 |
7 | 51333223430653 |
oct | 7264022477477 |
9 | 1708007627207 |
10 | 505200410431 |
11 | 185288508862 |
12 | 81ab2718767 |
13 | 38842678702 |
14 | 1a647b72a63 |
15 | d21c475771 |
hex | 75a04a7f3f |
505200410431 has 2 divisors, whose sum is σ = 505200410432. Its totient is φ = 505200410430.
The previous prime is 505200410419. The next prime is 505200410447. The reversal of 505200410431 is 134014002505.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 505200410431 - 25 = 505200410399 is a prime.
It is a super-2 number, since 2×5052004104312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 505200410396 and 505200410405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (505200410131) 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, 252600205215 + 252600205216.
It is an arithmetic number, because the mean of its divisors is an integer number (252600205216).
Almost surely, 2505200410431 is an apocalyptic number.
505200410431 is a deficient number, since it is larger than the sum of its proper divisors (1).
505200410431 is an equidigital number, since it uses as much as digits as its factorization.
505200410431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 505200410431 its reverse (134014002505), we get a palindrome (639214412936).
The spelling of 505200410431 in words is "five hundred five billion, two hundred million, four hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •