Base | Representation |
---|---|
bin | 1110111100011000010… |
… | …00010110010101111011 |
3 | 1211002022100201120002120 |
4 | 13132030020112111323 |
5 | 31403022214412011 |
6 | 1031513204332323 |
7 | 52044551620515 |
oct | 7361410262573 |
9 | 1732270646076 |
10 | 513452107131 |
11 | 188832368707 |
12 | 836160a40a3 |
13 | 395590a6592 |
14 | 1abcba38bb5 |
15 | d551adca06 |
hex | 778c21657b |
513452107131 has 4 divisors (see below), whose sum is σ = 684602809512. Its totient is φ = 342301404752.
The previous prime is 513452107127. The next prime is 513452107139. The reversal of 513452107131 is 131701254315.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 513452107131 - 22 = 513452107127 is a prime.
It is a super-2 number, since 2×5134521071312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 513452107092 and 513452107101.
It is not an unprimeable number, because it can be changed into a prime (513452107139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 85575351186 + ... + 85575351191.
It is an arithmetic number, because the mean of its divisors is an integer number (171150702378).
Almost surely, 2513452107131 is an apocalyptic number.
513452107131 is a deficient number, since it is larger than the sum of its proper divisors (171150702381).
513452107131 is a wasteful number, since it uses less digits than its factorization.
513452107131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171150702380.
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 513452107131 in words is "five hundred thirteen billion, four hundred fifty-two million, one hundred seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •