Base | Representation |
---|---|
bin | 100010001100000… |
… | …000011101110100 |
3 | 1110222021112012201 |
4 | 202030000131310 |
5 | 2133313313410 |
6 | 132525354244 |
7 | 20133201301 |
oct | 4214003564 |
9 | 1428245181 |
10 | 573572980 |
11 | 274848962 |
12 | 140108984 |
13 | 91aa4cc6 |
14 | 562680a8 |
15 | 3554c83a |
hex | 22300774 |
573572980 has 12 divisors (see below), whose sum is σ = 1204503300. Its totient is φ = 229429184.
The previous prime is 573572963. The next prime is 573572981. The reversal of 573572980 is 89275375.
It can be written as a sum of positive squares in 2 ways, for example, as 160833124 + 412739856 = 12682^2 + 20316^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 573572980.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (573572981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14339305 + ... + 14339344.
It is an arithmetic number, because the mean of its divisors is an integer number (100375275).
Almost surely, 2573572980 is an apocalyptic number.
It is an amenable number.
573572980 is an abundant number, since it is smaller than the sum of its proper divisors (630930320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
573572980 is a wasteful number, since it uses less digits than its factorization.
573572980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28678658 (or 28678656 counting only the distinct ones).
The product of its (nonzero) digits is 529200, while the sum is 46.
The square root of 573572980 is about 23949.3837081458. The cubic root of 573572980 is about 830.8632717442.
The spelling of 573572980 in words is "five hundred seventy-three million, five hundred seventy-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •