Base | Representation |
---|---|
bin | 100101001110… |
… | …010101100100 |
3 | 200100202112100 |
4 | 211032111210 |
5 | 4444224202 |
6 | 545052100 |
7 | 145641063 |
oct | 45162544 |
9 | 20322470 |
10 | 9758052 |
11 | 5565407 |
12 | 3327030 |
13 | 20386c5 |
14 | 14201da |
15 | ccb41c |
hex | 94e564 |
9758052 has 18 divisors (see below), whose sum is σ = 24666278. Its totient is φ = 3252672.
The previous prime is 9758029. The next prime is 9758057. The reversal of 9758052 is 2508579.
It can be written as a sum of positive squares in only one way, i.e., 8259876 + 1498176 = 2874^2 + 1224^2 .
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 271057 = 9758052 / (9 + 7 + 5 + 8 + 0 + 5 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 9757998 and 9758016.
It is not an unprimeable number, because it can be changed into a prime (9758057) 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 5 ways as a sum of consecutive naturals, for example, 135493 + ... + 135564.
Almost surely, 29758052 is an apocalyptic number.
It is an amenable number.
9758052 is an abundant number, since it is smaller than the sum of its proper divisors (14908226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9758052 is a wasteful number, since it uses less digits than its factorization.
9758052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271067 (or 271062 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The square root of 9758052 is about 3123.7880850019. The cubic root of 9758052 is about 213.6917272155.
The spelling of 9758052 in words is "nine million, seven hundred fifty-eight thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •