Base | Representation |
---|---|
bin | 1110111100100100001… |
… | …10110010101001000011 |
3 | 1211002120100101000222202 |
4 | 13132102012302221003 |
5 | 31403223401041201 |
6 | 1031531145223415 |
7 | 52050210024101 |
oct | 7362206625103 |
9 | 1732510330882 |
10 | 513552362051 |
11 | 188883a13713 |
12 | 83643791b6b |
13 | 39573aa9111 |
14 | 1abdb094c71 |
15 | d55a7e2c6b |
hex | 77921b2a43 |
513552362051 has 4 divisors (see below), whose sum is σ = 519322613400. Its totient is φ = 507782110704.
The previous prime is 513552362039. The next prime is 513552362083. The reversal of 513552362051 is 150263255315.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-513552362051 is a prime.
It is a super-2 number, since 2×5135523620512 (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 = 513552361996 and 513552362014.
It is not an unprimeable number, because it can be changed into a prime (513552362951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2885125541 + ... + 2885125718.
It is an arithmetic number, because the mean of its divisors is an integer number (129830653350).
Almost surely, 2513552362051 is an apocalyptic number.
513552362051 is a deficient number, since it is larger than the sum of its proper divisors (5770251349).
513552362051 is an equidigital number, since it uses as much as digits as its factorization.
513552362051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5770251348.
The product of its (nonzero) digits is 135000, while the sum is 38.
The spelling of 513552362051 in words is "five hundred thirteen billion, five hundred fifty-two million, three hundred sixty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •