Base | Representation |
---|---|
bin | 100010000111111… |
… | …011110010010000 |
3 | 1110220021021112111 |
4 | 202013323302100 |
5 | 2133030131412 |
6 | 132450435104 |
7 | 20121133315 |
oct | 4207736220 |
9 | 1426237474 |
10 | 572505232 |
11 | 274189722 |
12 | 13b892a94 |
13 | 917bccc0 |
14 | 5606ad0c |
15 | 353db2a7 |
hex | 221fbc90 |
572505232 has 40 divisors (see below), whose sum is σ = 1199782584. Its totient is φ = 263076864.
The previous prime is 572505203. The next prime is 572505251. The reversal of 572505232 is 232505275.
It can be written as a sum of positive squares in 4 ways, for example, as 147456 + 572357776 = 384^2 + 23924^2 .
It is a junction number, because it is equal to n+sod(n) for n = 572505194 and 572505203.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42558 + ... + 54370.
Almost surely, 2572505232 is an apocalyptic number.
572505232 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 572505232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (599891292).
572505232 is an abundant number, since it is smaller than the sum of its proper divisors (627277352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
572505232 is a wasteful number, since it uses less digits than its factorization.
572505232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12067 (or 12061 counting only the distinct ones).
The product of its (nonzero) digits is 21000, while the sum is 31.
The square root of 572505232 is about 23927.0815604411. The cubic root of 572505232 is about 830.3473805979.
The spelling of 572505232 in words is "five hundred seventy-two million, five hundred five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •