Base | Representation |
---|---|
bin | 1001000001001… |
… | …01011001011100 |
3 | 12021100110012000 |
4 | 10200211121130 |
5 | 123331310102 |
6 | 11301242300 |
7 | 1606006560 |
oct | 440453134 |
9 | 167313160 |
10 | 75650652 |
11 | 39780500 |
12 | 21403390 |
13 | 128997cc |
14 | a0936a0 |
15 | 699501c |
hex | 482565c |
75650652 has 144 divisors (see below), whose sum is σ = 246677760. Its totient is φ = 19625760.
The previous prime is 75650621. The next prime is 75650669. The reversal of 75650652 is 25605657.
It is a super-2 number, since 2×756506522 = 11446042296050208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 91063 + ... + 91889.
It is an arithmetic number, because the mean of its divisors is an integer number (1713040).
Almost surely, 275650652 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 75650652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123338880).
75650652 is an abundant number, since it is smaller than the sum of its proper divisors (171027108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75650652 is a wasteful number, since it uses less digits than its factorization.
75650652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869 (or 850 counting only the distinct ones).
The product of its (nonzero) digits is 63000, while the sum is 36.
The square root of 75650652 is about 8697.7383267146. The cubic root of 75650652 is about 422.9323366445.
The spelling of 75650652 in words is "seventy-five million, six hundred fifty thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •