Base | Representation |
---|---|
bin | 111010010001010011101011… |
… | …1111100000100100000110101 |
3 | 2111012210111122120011110220001 |
4 | 1310202213113330010200311 |
5 | 1014140123233033120232 |
6 | 5014035111130111301 |
7 | 212650445501454034 |
oct | 16442472774044065 |
9 | 2435714576143801 |
10 | 512552135051317 |
11 | 13935115a036839 |
12 | 495a0054b7b531 |
13 | 18ccc5c73b211a |
14 | 907d92736071b |
15 | 3e3c9cd4846e7 |
hex | 1d229d7f04835 |
512552135051317 has 2 divisors, whose sum is σ = 512552135051318. Its totient is φ = 512552135051316.
The previous prime is 512552135051311. The next prime is 512552135051389. The reversal of 512552135051317 is 713150531255215.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 374246397011601 + 138305738039716 = 19345449^2 + 11760346^2 .
It is a cyclic number.
It is not a de Polignac number, because 512552135051317 - 23 = 512552135051309 is a prime.
It is a super-2 number, since 2×5125521350513172 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (512552135051311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256276067525658 + 256276067525659.
It is an arithmetic number, because the mean of its divisors is an integer number (256276067525659).
Almost surely, 2512552135051317 is an apocalyptic number.
It is an amenable number.
512552135051317 is a deficient number, since it is larger than the sum of its proper divisors (1).
512552135051317 is an equidigital number, since it uses as much as digits as its factorization.
512552135051317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 787500, while the sum is 46.
The spelling of 512552135051317 in words is "five hundred twelve trillion, five hundred fifty-two billion, one hundred thirty-five million, fifty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •