Base | Representation |
---|---|
bin | 11111010011101… |
… | …101010111001000 |
3 | 1100121100222120200 |
4 | 133103231113020 |
5 | 2033431311412 |
6 | 124042052200 |
7 | 16005431640 |
oct | 3723552710 |
9 | 1317328520 |
10 | 525260232 |
11 | 24a54a872 |
12 | 127aaa060 |
13 | 84a8a893 |
14 | 4da8d520 |
15 | 311a79dc |
hex | 1f4ed5c8 |
525260232 has 48 divisors (see below), whose sum is σ = 1625807040. Its totient is φ = 150074208.
The previous prime is 525260191. The next prime is 525260233. The reversal of 525260232 is 232062525.
525260232 is a `hidden beast` number, since 5 + 2 + 52 + 602 + 3 + 2 = 666.
It is a super-2 number, since 2×5252602322 = 551796622641387648, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 525260196 and 525260205.
It is not an unprimeable number, because it can be changed into a prime (525260233) 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, 520588 + ... + 521595.
It is an arithmetic number, because the mean of its divisors is an integer number (33870980).
Almost surely, 2525260232 is an apocalyptic number.
It is an amenable number.
525260232 is an abundant number, since it is smaller than the sum of its proper divisors (1100546808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
525260232 is a wasteful number, since it uses less digits than its factorization.
525260232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1042202 (or 1042195 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The square root of 525260232 is about 22918.5564990468. The cubic root of 525260232 is about 806.8475917137.
The spelling of 525260232 in words is "five hundred twenty-five million, two hundred sixty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •