Base | Representation |
---|---|
bin | 1001000010100… |
… | …10001001010100 |
3 | 12021200202121110 |
4 | 10201102021110 |
5 | 123403141230 |
6 | 11305215020 |
7 | 1610402130 |
oct | 441221124 |
9 | 167622543 |
10 | 75833940 |
11 | 39896186 |
12 | 21491470 |
13 | 12932070 |
14 | a1003c0 |
15 | 69ce4b0 |
hex | 4852254 |
75833940 has 384 divisors, whose sum is σ = 298045440. Its totient is φ = 13934592.
The previous prime is 75833911. The next prime is 75833941. The reversal of 75833940 is 4933857.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (75833941) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1763559 + ... + 1763601.
It is an arithmetic number, because the mean of its divisors is an integer number (776160).
Almost surely, 275833940 is an apocalyptic number.
75833940 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 75833940, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149022720).
75833940 is an abundant number, since it is smaller than the sum of its proper divisors (222211500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75833940 is a wasteful number, since it uses less digits than its factorization.
75833940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 75833940 is about 8708.2684846070. The cubic root of 75833940 is about 423.2736243038.
The spelling of 75833940 in words is "seventy-five million, eight hundred thirty-three thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •