Base | Representation |
---|---|
bin | 111010010111011110100110… |
… | …0110110011001010011101011 |
3 | 2111022210120200000111102120021 |
4 | 1310232331030312121103223 |
5 | 1014243022104443231321 |
6 | 5015524444225341311 |
7 | 213065640453531025 |
oct | 16456751466312353 |
9 | 2438716600442507 |
10 | 513400205055211 |
11 | 13964889348a981 |
12 | 496b8495a97837 |
13 | 1906157c2c4686 |
14 | 90ac9b9981015 |
15 | 3e54ab6985941 |
hex | 1d2ef4cd994eb |
513400205055211 has 2 divisors, whose sum is σ = 513400205055212. Its totient is φ = 513400205055210.
The previous prime is 513400205055121. The next prime is 513400205055251. The reversal of 513400205055211 is 112550502004315.
Together with previous prime (513400205055121) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 513400205055211 - 29 = 513400205054699 is a prime.
It is not a weakly prime, because it can be changed into another prime (513400205055251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256700102527605 + 256700102527606.
It is an arithmetic number, because the mean of its divisors is an integer number (256700102527606).
Almost surely, 2513400205055211 is an apocalyptic number.
513400205055211 is a deficient number, since it is larger than the sum of its proper divisors (1).
513400205055211 is an equidigital number, since it uses as much as digits as its factorization.
513400205055211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 34.
Adding to 513400205055211 its reverse (112550502004315), we get a palindrome (625950707059526).
The spelling of 513400205055211 in words is "five hundred thirteen trillion, four hundred billion, two hundred five million, fifty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •