Base | Representation |
---|---|
bin | 111010010110010000011010… |
… | …1000111011011110110010111 |
3 | 2111022012112021122102121122212 |
4 | 1310230200311013123312113 |
5 | 1014232244224101104333 |
6 | 5015315355400544035 |
7 | 213050544630040556 |
oct | 16454406507336627 |
9 | 2438175248377585 |
10 | 513232303144343 |
11 | 139593663206172 |
12 | 4968ba37a8201b |
13 | 1904b7a1c39763 |
14 | 90a480c817d9d |
15 | 3e5053b426448 |
hex | 1d2c8351dbd97 |
513232303144343 has 32 divisors (see below), whose sum is σ = 562967838869760. Its totient is φ = 465716760122880.
The previous prime is 513232303144303. The next prime is 513232303144357. The reversal of 513232303144343 is 343441303232315.
It is not a de Polignac number, because 513232303144343 - 26 = 513232303144279 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 513232303144343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513232303144303) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 968121596 + ... + 968651582.
It is an arithmetic number, because the mean of its divisors is an integer number (17592744964680).
Almost surely, 2513232303144343 is an apocalyptic number.
513232303144343 is a deficient number, since it is larger than the sum of its proper divisors (49735535725417).
513232303144343 is a wasteful number, since it uses less digits than its factorization.
513232303144343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532847.
The product of its (nonzero) digits is 933120, while the sum is 41.
Adding to 513232303144343 its reverse (343441303232315), we get a palindrome (856673606376658).
The spelling of 513232303144343 in words is "five hundred thirteen trillion, two hundred thirty-two billion, three hundred three million, one hundred forty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •