Base | Representation |
---|---|
bin | 111010010110010000011010… |
… | …1000011000111000010110111 |
3 | 2111022012112021120022000101120 |
4 | 1310230200311003013002313 |
5 | 1014232244223303314201 |
6 | 5015315355320355023 |
7 | 213050544614306214 |
oct | 16454406503070267 |
9 | 2438175246260346 |
10 | 513232302010551 |
11 | 139593662601352 |
12 | 4968ba37615a73 |
13 | 1904b7a1930686 |
14 | 90a480c600b0b |
15 | 3e5053b2a0536 |
hex | 1d2c8350c70b7 |
513232302010551 has 8 divisors (see below), whose sum is σ = 684310008184704. Its totient is φ = 342154731921720.
The previous prime is 513232302010541. The next prime is 513232302010663. The reversal of 513232302010551 is 155010203232315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 513232302010551 - 222 = 513232297816247 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513232302010541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24869715 + ... + 40558196.
It is an arithmetic number, because the mean of its divisors is an integer number (85538751023088).
Almost surely, 2513232302010551 is an apocalyptic number.
513232302010551 is a deficient number, since it is larger than the sum of its proper divisors (171077706174153).
513232302010551 is a wasteful number, since it uses less digits than its factorization.
513232302010551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68042661.
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 513232302010551 its reverse (155010203232315), we get a palindrome (668242505242866).
The spelling of 513232302010551 in words is "five hundred thirteen trillion, two hundred thirty-two billion, three hundred two million, ten thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •