Base | Representation |
---|---|
bin | 100000111011111… |
… | …001011101100000 |
3 | 1102111202121100002 |
4 | 200323321131200 |
5 | 2112424312033 |
6 | 130455315132 |
7 | 16456535216 |
oct | 4073713540 |
9 | 1374677302 |
10 | 552572768 |
11 | 263a05110 |
12 | 13507baa8 |
13 | 8a631547 |
14 | 5355ccb6 |
15 | 337a03e8 |
hex | 20ef9760 |
552572768 has 96 divisors (see below), whose sum is σ = 1242501120. Its totient is φ = 239616000.
The previous prime is 552572767. The next prime is 552572789. The reversal of 552572768 is 867275255.
552572768 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552572767) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 861728 + ... + 862368.
It is an arithmetic number, because the mean of its divisors is an integer number (12942720).
Almost surely, 2552572768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 552572768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (621250560).
552572768 is an abundant number, since it is smaller than the sum of its proper divisors (689928352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552572768 is a wasteful number, since it uses less digits than its factorization.
552572768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772 (or 764 counting only the distinct ones).
The product of its digits is 1176000, while the sum is 47.
The square root of 552572768 is about 23506.8664011178. The cubic root of 552572768 is about 820.5968131915.
The spelling of 552572768 in words is "five hundred fifty-two million, five hundred seventy-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •