Base | Representation |
---|---|
bin | 111010010110001000000010… |
… | …1100011111110010101111111 |
3 | 2111022010210212202020010101202 |
4 | 1310230100011203332111333 |
5 | 1014232000414303400421 |
6 | 5015303223432330115 |
7 | 213046340262130055 |
oct | 16454200543762577 |
9 | 2438123782203352 |
10 | 513214325450111 |
11 | 139586a7827942a |
12 | 4968845b24393b |
13 | 19049b98518c6c |
14 | 90a39c4d561d5 |
15 | 3e4ed37ec710b |
hex | 1d2c4058fe57f |
513214325450111 has 8 divisors (see below), whose sum is σ = 517200811048704. Its totient is φ = 509241376306080.
The previous prime is 513214325450023. The next prime is 513214325450149. The reversal of 513214325450111 is 111054523412315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 513214325450111 - 226 = 513214258341247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513214325450171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3384037520 + ... + 3384189173.
It is an arithmetic number, because the mean of its divisors is an integer number (64650101381088).
Almost surely, 2513214325450111 is an apocalyptic number.
513214325450111 is a deficient number, since it is larger than the sum of its proper divisors (3986485598593).
513214325450111 is a wasteful number, since it uses less digits than its factorization.
513214325450111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6768227281.
The product of its (nonzero) digits is 72000, while the sum is 38.
Adding to 513214325450111 its reverse (111054523412315), we get a palindrome (624268848862426).
The spelling of 513214325450111 in words is "five hundred thirteen trillion, two hundred fourteen billion, three hundred twenty-five million, four hundred fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •