Base | Representation |
---|---|
bin | 1110111100110001001… |
… | …01010100111111100101 |
3 | 1211002211220211221220102 |
4 | 13132120211110333211 |
5 | 31403434210432443 |
6 | 1031550030313445 |
7 | 52052666501261 |
oct | 7363045247745 |
9 | 1732756757812 |
10 | 513661030373 |
11 | 18892a295847 |
12 | 83674058885 |
13 | 395904662ba |
14 | 1ac0b6a10a1 |
15 | d56510acb8 |
hex | 7798954fe5 |
513661030373 has 2 divisors, whose sum is σ = 513661030374. Its totient is φ = 513661030372.
The previous prime is 513661030297. The next prime is 513661030423. The reversal of 513661030373 is 373030166315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 404697000964 + 108964029409 = 636158^2 + 330097^2 .
It is a cyclic number.
It is not a de Polignac number, because 513661030373 - 28 = 513661030117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (513661030573) 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, 256830515186 + 256830515187.
It is an arithmetic number, because the mean of its divisors is an integer number (256830515187).
Almost surely, 2513661030373 is an apocalyptic number.
It is an amenable number.
513661030373 is a deficient number, since it is larger than the sum of its proper divisors (1).
513661030373 is an equidigital number, since it uses as much as digits as its factorization.
513661030373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 38.
Adding to 513661030373 its reverse (373030166315), we get a palindrome (886691196688).
The spelling of 513661030373 in words is "five hundred thirteen billion, six hundred sixty-one million, thirty thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.329 sec. • engine limits •