Base | Representation |
---|---|
bin | 111010010100100101011000… |
… | …0001110000100010101001001 |
3 | 2111021101112222002211112201202 |
4 | 1310221022300032010111021 |
5 | 1014220012444200342401 |
6 | 5015022022333153545 |
7 | 213025126462456004 |
oct | 16451126016042511 |
9 | 2437345862745652 |
10 | 513002440246601 |
11 | 139505127633998 |
12 | 4965338732b8b5 |
13 | 19032bcba898b6 |
14 | 90976445ba53b |
15 | 3e4958640b06b |
hex | 1d292b0384549 |
513002440246601 has 32 divisors (see below), whose sum is σ = 560130348476160. Its totient is φ = 467914952448000.
The previous prime is 513002440246577. The next prime is 513002440246603. The reversal of 513002440246601 is 106642044200315.
It is a cyclic number.
It is not a de Polignac number, because 513002440246601 - 218 = 513002439984457 is a prime.
It is a super-3 number, since 3×5130024402466013 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (513002440246603) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4466309510 + ... + 4466424368.
It is an arithmetic number, because the mean of its divisors is an integer number (17504073389880).
Almost surely, 2513002440246601 is an apocalyptic number.
It is an amenable number.
513002440246601 is a deficient number, since it is larger than the sum of its proper divisors (47127908229559).
513002440246601 is a wasteful number, since it uses less digits than its factorization.
513002440246601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157505.
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 513002440246601 its reverse (106642044200315), we get a palindrome (619644484446916).
The spelling of 513002440246601 in words is "five hundred thirteen trillion, two billion, four hundred forty million, two hundred forty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •