Base | Representation |
---|---|
bin | 111010011000010010011100… |
… | …1000011100011111110000100 |
3 | 2111100012020001021210221020001 |
4 | 1310300210321003203332010 |
5 | 1014301333114240042012 |
6 | 5020051540141051044 |
7 | 213106661502101434 |
oct | 16460447103437604 |
9 | 2440166037727201 |
10 | 513511542112132 |
11 | 139691027338703 |
12 | 49715b88556a84 |
13 | 1906bc13802605 |
14 | 90b413c5702c4 |
15 | 3e5793113d357 |
hex | 1d309390e3f84 |
513511542112132 has 48 divisors (see below), whose sum is σ = 939762658340352. Its totient is φ = 245056885032960.
The previous prime is 513511542112067. The next prime is 513511542112133. The reversal of 513511542112132 is 231211245115315.
It is a junction number, because it is equal to n+sod(n) for n = 513511542112091 and 513511542112100.
It is not an unprimeable number, because it can be changed into a prime (513511542112133) 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 15 ways as a sum of consecutive naturals, for example, 181842868 + ... + 184645204.
It is an arithmetic number, because the mean of its divisors is an integer number (19578388715424).
Almost surely, 2513511542112132 is an apocalyptic number.
It is an amenable number.
513511542112132 is a deficient number, since it is larger than the sum of its proper divisors (426251116228220).
513511542112132 is a wasteful number, since it uses less digits than its factorization.
513511542112132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2806708 (or 2806706 counting only the distinct ones).
The product of its digits is 36000, while the sum is 37.
Adding to 513511542112132 its reverse (231211245115315), we get a palindrome (744722787227447).
The spelling of 513511542112132 in words is "five hundred thirteen trillion, five hundred eleven billion, five hundred forty-two million, one hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •