Base | Representation |
---|---|
bin | 100010010001110… |
… | …110111111100000 |
3 | 1111002011110112202 |
4 | 202101312333200 |
5 | 2134211411130 |
6 | 133022312332 |
7 | 20152220624 |
oct | 4221667740 |
9 | 1432143482 |
10 | 575107040 |
11 | 2756a6482 |
12 | 1407286a8 |
13 | 921c1331 |
14 | 56547184 |
15 | 35752145 |
hex | 22476fe0 |
575107040 has 96 divisors (see below), whose sum is σ = 1432940544. Its totient is φ = 217797120.
The previous prime is 575107037. The next prime is 575107061. The reversal of 575107040 is 40701575.
575107040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 575106994 and 575107012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 231887 + ... + 234353.
It is an arithmetic number, because the mean of its divisors is an integer number (14926464).
Almost surely, 2575107040 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 575107040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (716470272).
575107040 is an abundant number, since it is smaller than the sum of its proper divisors (857833504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
575107040 is a wasteful number, since it uses less digits than its factorization.
575107040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2560 (or 2552 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 29.
The square root of 575107040 is about 23981.3894509889. The cubic root of 575107040 is about 831.6033458126.
The spelling of 575107040 in words is "five hundred seventy-five million, one hundred seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •