Base | Representation |
---|---|
bin | 1110111011101000100… |
… | …00010100101001000111 |
3 | 1211001021102222211222001 |
4 | 13131310100110221013 |
5 | 31401212143403020 |
6 | 1031405335050131 |
7 | 52031616112414 |
oct | 7356420245107 |
9 | 1731242884861 |
10 | 513051544135 |
11 | 188647248809 |
12 | 83523b10947 |
13 | 394c40c8960 |
14 | 1ab9076910b |
15 | d52b86750a |
hex | 7774414a47 |
513051544135 has 16 divisors (see below), whose sum is σ = 664123703040. Its totient is φ = 378238406400.
The previous prime is 513051544091. The next prime is 513051544139. The reversal of 513051544135 is 531445150315.
It is not a de Polignac number, because 513051544135 - 27 = 513051544007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 513051544094 and 513051544103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513051544139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6527575 + ... + 6605704.
It is an arithmetic number, because the mean of its divisors is an integer number (41507731440).
Almost surely, 2513051544135 is an apocalyptic number.
513051544135 is a deficient number, since it is larger than the sum of its proper divisors (151072158905).
513051544135 is a wasteful number, since it uses less digits than its factorization.
513051544135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13133898.
The product of its (nonzero) digits is 90000, while the sum is 37.
The spelling of 513051544135 in words is "five hundred thirteen billion, fifty-one million, five hundred forty-four thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •