Base | Representation |
---|---|
bin | 11110100001010… |
… | …011111111101011 |
3 | 1022200111210100122 |
4 | 132201103333223 |
5 | 2022041033011 |
6 | 122450553455 |
7 | 15455226416 |
oct | 3641237753 |
9 | 1280453318 |
10 | 512049131 |
11 | 243047100 |
12 | 12359888b |
13 | 82113569 |
14 | 4c010b7d |
15 | 2ee483db |
hex | 1e853feb |
512049131 has 6 divisors (see below), whose sum is σ = 562830996. Its totient is φ = 465499100.
The previous prime is 512049101. The next prime is 512049133. The reversal of 512049131 is 131940215.
It is a de Polignac number, because none of the positive numbers 2k-512049131 is a prime.
It is a super-2 number, since 2×5120491312 = 524388625115710322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 512049131.
It is not an unprimeable number, because it can be changed into a prime (512049133) 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 5 ways as a sum of consecutive naturals, for example, 2115785 + ... + 2116026.
It is an arithmetic number, because the mean of its divisors is an integer number (93805166).
Almost surely, 2512049131 is an apocalyptic number.
512049131 is a deficient number, since it is larger than the sum of its proper divisors (50781865).
512049131 is a wasteful number, since it uses less digits than its factorization.
512049131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4231833 (or 4231822 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 512049131 is about 22628.5026239033. The cubic root of 512049131 is about 800.0255882440.
Adding to 512049131 its reverse (131940215), we get a palindrome (643989346).
The spelling of 512049131 in words is "five hundred twelve million, forty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •