Base | Representation |
---|---|
bin | 1001000010010… |
… | …01010011110100 |
3 | 12021121220222000 |
4 | 10201021103310 |
5 | 123401011443 |
6 | 11304335300 |
7 | 1610161455 |
oct | 441112364 |
9 | 167556860 |
10 | 75797748 |
11 | 39870a74 |
12 | 21474530 |
13 | 1291b750 |
14 | a0d112c |
15 | 69c38d3 |
hex | 48494f4 |
75797748 has 48 divisors (see below), whose sum is σ = 211632960. Its totient is φ = 23321952.
The previous prime is 75797737. The next prime is 75797767. The reversal of 75797748 is 84779757.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 75797694 and 75797703.
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 15 ways as a sum of consecutive naturals, for example, 25590 + ... + 28397.
It is an arithmetic number, because the mean of its divisors is an integer number (4409020).
Almost surely, 275797748 is an apocalyptic number.
75797748 is a gapful number since it is divisible by the number (78) formed by its first and last digit.
It is an amenable number.
75797748 is an abundant number, since it is smaller than the sum of its proper divisors (135835212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75797748 is a wasteful number, since it uses less digits than its factorization.
75797748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54013 (or 54005 counting only the distinct ones).
The product of its digits is 3457440, while the sum is 54.
The square root of 75797748 is about 8706.1902115679. The cubic root of 75797748 is about 423.2062773406.
Subtracting 75797748 from its reverse (84779757), we obtain a square (8982009 = 29972).
The spelling of 75797748 in words is "seventy-five million, seven hundred ninety-seven thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •