Base | Representation |
---|---|
bin | 11111010110010… |
… | …000111010011101 |
3 | 1100122122000112010 |
4 | 133112100322131 |
5 | 2034114231031 |
6 | 124104301433 |
7 | 16014222012 |
oct | 3726207235 |
9 | 1318560463 |
10 | 525930141 |
11 | 24a968110 |
12 | 128171879 |
13 | 84c63789 |
14 | 4dbc5709 |
15 | 3128b246 |
hex | 1f590e9d |
525930141 has 16 divisors (see below), whose sum is σ = 781267968. Its totient is φ = 311962800.
The previous prime is 525930133. The next prime is 525930149. The reversal of 525930141 is 141039525.
It is an interprime number because it is at equal distance from previous prime (525930133) and next prime (525930149).
It is not a de Polignac number, because 525930141 - 23 = 525930133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 525930099 and 525930108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (525930149) 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 15 ways as a sum of consecutive naturals, for example, 167995 + ... + 171096.
It is an arithmetic number, because the mean of its divisors is an integer number (48829248).
Almost surely, 2525930141 is an apocalyptic number.
It is an amenable number.
525930141 is a deficient number, since it is larger than the sum of its proper divisors (255337827).
525930141 is a wasteful number, since it uses less digits than its factorization.
525930141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339152.
The product of its (nonzero) digits is 5400, while the sum is 30.
The square root of 525930141 is about 22933.1668332134. The cubic root of 525930141 is about 807.1904597532.
Adding to 525930141 its reverse (141039525), we get a palindrome (666969666).
The spelling of 525930141 in words is "five hundred twenty-five million, nine hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •