Base | Representation |
---|---|
bin | 1110111100101101110… |
… | …10110010000011110101 |
3 | 1211002202222021221122221 |
4 | 13132112322302003311 |
5 | 31403410033200041 |
6 | 1031543151522341 |
7 | 52052210212546 |
oct | 7362672620365 |
9 | 1732688257587 |
10 | 513633100021 |
11 | 188915549308 |
12 | 836668293b1 |
13 | 39587737372 |
14 | 1ac07ab04cd |
15 | d5629402d1 |
hex | 7796eb20f5 |
513633100021 has 2 divisors, whose sum is σ = 513633100022. Its totient is φ = 513633100020.
The previous prime is 513633099977. The next prime is 513633100027. The reversal of 513633100021 is 120001336315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 480091008996 + 33542091025 = 692886^2 + 183145^2 .
It is a cyclic number.
It is not a de Polignac number, because 513633100021 - 29 = 513633099509 is a prime.
It is a super-2 number, since 2×5136331000212 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (513633100027) 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, 256816550010 + 256816550011.
It is an arithmetic number, because the mean of its divisors is an integer number (256816550011).
Almost surely, 2513633100021 is an apocalyptic number.
It is an amenable number.
513633100021 is a deficient number, since it is larger than the sum of its proper divisors (1).
513633100021 is an equidigital number, since it uses as much as digits as its factorization.
513633100021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 513633100021 its reverse (120001336315), we get a palindrome (633634436336).
The spelling of 513633100021 in words is "five hundred thirteen billion, six hundred thirty-three million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •