Base | Representation |
---|---|
bin | 111010001110101111110011… |
… | …1110001001010101101110001 |
3 | 2111011112212021112022201110122 |
4 | 1310131133213301022231301 |
5 | 1014113342014101412241 |
6 | 5013205310221540025 |
7 | 212613146525146244 |
oct | 16435374761125561 |
9 | 2434485245281418 |
10 | 512200213310321 |
11 | 139225988421a98 |
12 | 495439bb114615 |
13 | 18ca537163a263 |
14 | 906a8a05a525b |
15 | 3e3378287b04b |
hex | 1d1d7e7c4ab71 |
512200213310321 has 16 divisors (see below), whose sum is σ = 524384896930560. Its totient is φ = 500070600132480.
The previous prime is 512200213310297. The next prime is 512200213310431. The reversal of 512200213310321 is 123013312002215.
It is a cyclic number.
It is not a de Polignac number, because 512200213310321 - 210 = 512200213309297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (512200213390321) 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 in 15 ways as a sum of consecutive naturals, for example, 24524981 + ... + 40322141.
It is an arithmetic number, because the mean of its divisors is an integer number (32774056058160).
Almost surely, 2512200213310321 is an apocalyptic number.
It is an amenable number.
512200213310321 is a deficient number, since it is larger than the sum of its proper divisors (12184683620239).
512200213310321 is a wasteful number, since it uses less digits than its factorization.
512200213310321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15798904.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 512200213310321 its reverse (123013312002215), we get a palindrome (635213525312536).
The spelling of 512200213310321 in words is "five hundred twelve trillion, two hundred billion, two hundred thirteen million, three hundred ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •