Base | Representation |
---|---|
bin | 1110111100001001101… |
… | …10100011000010011111 |
3 | 1211001222211221212122101 |
4 | 13132010312203002133 |
5 | 31402244440000111 |
6 | 1031453123225531 |
7 | 52041540002242 |
oct | 7360466430237 |
9 | 1731884855571 |
10 | 513330000031 |
11 | 18877a447852 |
12 | 835a12182a7 |
13 | 395399c2564 |
14 | 1abb9731259 |
15 | d54601cbc1 |
hex | 7784da309f |
513330000031 has 8 divisors (see below), whose sum is σ = 514348352784. Its totient is φ = 512311775040.
The previous prime is 513329999989. The next prime is 513330000049. The reversal of 513330000031 is 130000033315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 513330000031 - 229 = 512793129119 is a prime.
It is a super-2 number, since 2×5133300000312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 513329999963 and 513330000008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513330000431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14255856 + ... + 14291818.
It is an arithmetic number, because the mean of its divisors is an integer number (64293544098).
Almost surely, 2513330000031 is an apocalyptic number.
513330000031 is a deficient number, since it is larger than the sum of its proper divisors (1018352753).
513330000031 is a wasteful number, since it uses less digits than its factorization.
513330000031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63881.
The product of its (nonzero) digits is 405, while the sum is 19.
Adding to 513330000031 its reverse (130000033315), we get a palindrome (643330033346).
The spelling of 513330000031 in words is "five hundred thirteen billion, three hundred thirty million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •