Base | Representation |
---|---|
bin | 1000010010100… |
… | …1111111011000 |
3 | 2102102202022222 |
4 | 2010221333120 |
5 | 32400300000 |
6 | 3241203212 |
7 | 601403561 |
oct | 204517730 |
9 | 72382288 |
10 | 34775000 |
11 | 186a1a77 |
12 | b790508 |
13 | 7287530 |
14 | 4893168 |
15 | 30bda85 |
hex | 2129fd8 |
34775000 has 96 divisors (see below), whose sum is σ = 88588080. Its totient is φ = 12720000.
The previous prime is 34774981. The next prime is 34775009. The reversal of 34775000 is 57743.
34775000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34775009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 324947 + ... + 325053.
Almost surely, 234775000 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 34775000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44294040).
34775000 is an abundant number, since it is smaller than the sum of its proper divisors (53813080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
34775000 is a wasteful number, since it uses less digits than its factorization.
34775000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151 (or 127 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 26.
The square root of 34775000 is about 5897.0331523572. The cubic root of 34775000 is about 326.4041808304.
The spelling of 34775000 in words is "thirty-four million, seven hundred seventy-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •