Base | Representation |
---|---|
bin | 11110011010010… |
… | …111011010100011 |
3 | 1022120002021102012 |
4 | 132122113122203 |
5 | 2021104300011 |
6 | 122343543135 |
7 | 15433603400 |
oct | 3632273243 |
9 | 1276067365 |
10 | 510228131 |
11 | 242012a46 |
12 | 122a5aaab |
13 | 8192674a |
14 | 4ba992a7 |
15 | 2ebd8a8b |
hex | 1e6976a3 |
510228131 has 12 divisors (see below), whose sum is σ = 594028008. Its totient is φ = 436972032.
The previous prime is 510228119. The next prime is 510228139. The reversal of 510228131 is 131822015.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-510228131 is a prime.
It is a super-2 number, since 2×5102281312 = 520665491327506322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 510228097 and 510228106.
It is not an unprimeable number, because it can be changed into a prime (510228139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66275 + ... + 73571.
It is an arithmetic number, because the mean of its divisors is an integer number (49502334).
Almost surely, 2510228131 is an apocalyptic number.
510228131 is a deficient number, since it is larger than the sum of its proper divisors (83799877).
510228131 is a wasteful number, since it uses less digits than its factorization.
510228131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8738 (or 8731 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 510228131 is about 22588.2299217978. The cubic root of 510228131 is about 799.0760849495.
It can be divided in two parts, 5102 and 28131, that added together give a palindrome (33233).
The spelling of 510228131 in words is "five hundred ten million, two hundred twenty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •