Base | Representation |
---|---|
bin | 1110111011110010000… |
… | …01100000000111011101 |
3 | 1211001111000112022121000 |
4 | 13131321001200013131 |
5 | 31401343133420203 |
6 | 1031421313500513 |
7 | 52033610111301 |
oct | 7357101400735 |
9 | 1731430468530 |
10 | 513131545053 |
11 | 18868841a676 |
12 | 83546871739 |
13 | 3950785958a |
14 | 1ab9b231d01 |
15 | d5338bb4a3 |
hex | 77790601dd |
513131545053 has 8 divisors (see below), whose sum is σ = 760194881600. Its totient is φ = 342087696684.
The previous prime is 513131545019. The next prime is 513131545063. The reversal of 513131545053 is 350545131315.
513131545053 is a `hidden beast` number, since 5 + 1 + 31 + 31 + 545 + 0 + 53 = 666.
It is not a de Polignac number, because 513131545053 - 28 = 513131544797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 513131544999 and 513131545017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513131545063) 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, 9502435993 + ... + 9502436046.
It is an arithmetic number, because the mean of its divisors is an integer number (95024360200).
Almost surely, 2513131545053 is an apocalyptic number.
It is an amenable number.
513131545053 is a deficient number, since it is larger than the sum of its proper divisors (247063336547).
513131545053 is a wasteful number, since it uses less digits than its factorization.
513131545053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19004872048 (or 19004872042 counting only the distinct ones).
The product of its (nonzero) digits is 67500, while the sum is 36.
Adding to 513131545053 its reverse (350545131315), we get a palindrome (863676676368).
The spelling of 513131545053 in words is "five hundred thirteen billion, one hundred thirty-one million, five hundred forty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •