Base | Representation |
---|---|
bin | 11111011110101… |
… | …111011001000011 |
3 | 1100210210220112001 |
4 | 133132233121003 |
5 | 2040201332011 |
6 | 124224044431 |
7 | 16042135063 |
oct | 3736573103 |
9 | 1323726461 |
10 | 528152131 |
11 | 251145571 |
12 | 128a63717 |
13 | 85560c70 |
14 | 502033a3 |
15 | 315797c1 |
hex | 1f7af643 |
528152131 has 16 divisors (see below), whose sum is σ = 573836256. Its totient is φ = 483215616.
The previous prime is 528152123. The next prime is 528152159. The reversal of 528152131 is 131251825.
It is not a de Polignac number, because 528152131 - 23 = 528152123 is a prime.
It is a super-2 number, since 2×5281521312 = 557889346959682322, 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 528152131.
It is not an unprimeable number, because it can be changed into a prime (558152131) 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 15 ways as a sum of consecutive naturals, for example, 1191996 + ... + 1192438.
It is an arithmetic number, because the mean of its divisors is an integer number (35864766).
Almost surely, 2528152131 is an apocalyptic number.
528152131 is a deficient number, since it is larger than the sum of its proper divisors (45684125).
528152131 is a wasteful number, since it uses less digits than its factorization.
528152131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1062.
The product of its digits is 2400, while the sum is 28.
The square root of 528152131 is about 22981.5606737227. The cubic root of 528152131 is about 808.3256226659.
It can be divided in two parts, 52815 and 2131, that added together give a triangular number (54946 = T331).
The spelling of 528152131 in words is "five hundred twenty-eight million, one hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •