Base | Representation |
---|---|
bin | 111010010110000111011111… |
… | …1000111001101010100000111 |
3 | 2111022010200211101012001022212 |
4 | 1310230032333013031110013 |
5 | 1014231441004214113020 |
6 | 5015302510251214035 |
7 | 213046266060554324 |
oct | 16454167707152407 |
9 | 2438120741161285 |
10 | 513213143504135 |
11 | 139586521083978 |
12 | 4968818b44731b |
13 | 19049a3a6a6249 |
14 | 90a3911da5b4b |
15 | 3e4ecb9355cc5 |
hex | 1d2c3bf1cd507 |
513213143504135 has 8 divisors (see below), whose sum is σ = 648269233900080. Its totient is φ = 388961540339904.
The previous prime is 513213143503999. The next prime is 513213143504167. The reversal of 513213143504135 is 531405341312315.
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 513213143504135 - 210 = 513213143503111 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 513213143504092 and 513213143504101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2701121807822 + ... + 2701121808011.
It is an arithmetic number, because the mean of its divisors is an integer number (81033654237510).
Almost surely, 2513213143504135 is an apocalyptic number.
513213143504135 is a deficient number, since it is larger than the sum of its proper divisors (135056090395945).
513213143504135 is a wasteful number, since it uses less digits than its factorization.
513213143504135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5402243615857.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 513213143504135 in words is "five hundred thirteen trillion, two hundred thirteen billion, one hundred forty-three million, five hundred four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •