Base | Representation |
---|---|
bin | 1000111100100… |
… | …11011011000100 |
3 | 12020020002000010 |
4 | 10132103123010 |
5 | 123203141430 |
6 | 11240350220 |
7 | 1600636440 |
oct | 436233304 |
9 | 166202003 |
10 | 75052740 |
11 | 39402264 |
12 | 21175370 |
13 | 1271a609 |
14 | 9d79820 |
15 | 68c7cb0 |
hex | 47936c4 |
75052740 has 48 divisors (see below), whose sum is σ = 240170112. Its totient is φ = 17154816.
The previous prime is 75052723. The next prime is 75052741. The reversal of 75052740 is 4725057.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 75052698 and 75052707.
It is not an unprimeable number, because it can be changed into a prime (75052741) 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 15 ways as a sum of consecutive naturals, for example, 88929 + ... + 89768.
It is an arithmetic number, because the mean of its divisors is an integer number (5003544).
Almost surely, 275052740 is an apocalyptic number.
75052740 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
75052740 is an abundant number, since it is smaller than the sum of its proper divisors (165117372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75052740 is a wasteful number, since it uses less digits than its factorization.
75052740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178716 (or 178714 counting only the distinct ones).
The product of its (nonzero) digits is 9800, while the sum is 30.
The square root of 75052740 is about 8663.2984480508. The cubic root of 75052740 is about 421.8151597978.
Adding to 75052740 its reverse (4725057), we get a palindrome (79777797).
The spelling of 75052740 in words is "seventy-five million, fifty-two thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •