Base | Representation |
---|---|
bin | 1110111100011010011… |
… | …00110101110010101101 |
3 | 1211002100121111202012010 |
4 | 13132031030311302231 |
5 | 31403041313433431 |
6 | 1031515045231433 |
7 | 52045160340360 |
oct | 7361514656255 |
9 | 1732317452163 |
10 | 513470061741 |
11 | 18884151122a |
12 | 83620102579 |
13 | 3955ca21a00 |
14 | 1abd01900d7 |
15 | d553487846 |
hex | 778d335cad |
513470061741 has 24 divisors (see below), whose sum is σ = 847247309760. Its totient is φ = 270841349376.
The previous prime is 513470061733. The next prime is 513470061751. The reversal of 513470061741 is 147160074315.
It is a happy number.
It is not a de Polignac number, because 513470061741 - 23 = 513470061733 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 513470061741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513470061701) 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 23 ways as a sum of consecutive naturals, for example, 72336556 + ... + 72343653.
It is an arithmetic number, because the mean of its divisors is an integer number (35301971240).
Almost surely, 2513470061741 is an apocalyptic number.
It is an amenable number.
513470061741 is a deficient number, since it is larger than the sum of its proper divisors (333777248019).
513470061741 is a wasteful number, since it uses less digits than its factorization.
513470061741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144680245 (or 144680232 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 39.
The spelling of 513470061741 in words is "five hundred thirteen billion, four hundred seventy million, sixty-one thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •