Base | Representation |
---|---|
bin | 1110111011100011100… |
… | …11011110010110100101 |
3 | 1211001011120121220021100 |
4 | 13131301303132112211 |
5 | 31401121132133201 |
6 | 1031401305510313 |
7 | 52030606453311 |
oct | 7356163362645 |
9 | 1731146556240 |
10 | 513010427301 |
11 | 188626015059 |
12 | 835121a2399 |
13 | 394b8730978 |
14 | 1ab89104b41 |
15 | d527e44886 |
hex | 7771cde5a5 |
513010427301 has 12 divisors (see below), whose sum is σ = 773233108128. Its totient is φ = 327137083944.
The previous prime is 513010427273. The next prime is 513010427359. The reversal of 513010427301 is 103724010315.
513010427301 is a `hidden beast` number, since 51 + 301 + 0 + 4 + 2 + 7 + 301 = 666.
It is not a de Polignac number, because 513010427301 - 211 = 513010425253 is a prime.
It is a super-3 number, since 3×5130104273013 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513010429301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1239155415 + ... + 1239155828.
It is an arithmetic number, because the mean of its divisors is an integer number (64436092344).
Almost surely, 2513010427301 is an apocalyptic number.
It is an amenable number.
513010427301 is a deficient number, since it is larger than the sum of its proper divisors (260222680827).
513010427301 is a wasteful number, since it uses less digits than its factorization.
513010427301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2478311272 (or 2478311269 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
Adding to 513010427301 its reverse (103724010315), we get a palindrome (616734437616).
The spelling of 513010427301 in words is "five hundred thirteen billion, ten million, four hundred twenty-seven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •