Base | Representation |
---|---|
bin | 1000110101001… |
… | …11000110011001 |
3 | 12011101220012001 |
4 | 10122213012121 |
5 | 122431203021 |
6 | 11203521001 |
7 | 1556465362 |
oct | 432470631 |
9 | 164356161 |
10 | 74084761 |
11 | 38900a83 |
12 | 20989161 |
13 | 1246bb4a |
14 | 9ba6b69 |
15 | 6786091 |
hex | 46a7199 |
74084761 has 4 divisors (see below), whose sum is σ = 76474624. Its totient is φ = 71694900.
The previous prime is 74084753. The next prime is 74084779. The reversal of 74084761 is 16748047.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 16748047 = 149 ⋅112403.
It is a cyclic number.
It is not a de Polignac number, because 74084761 - 23 = 74084753 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 74084761.
It is not an unprimeable number, because it can be changed into a prime (74084701) 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 3 ways as a sum of consecutive naturals, for example, 1194885 + ... + 1194946.
It is an arithmetic number, because the mean of its divisors is an integer number (19118656).
Almost surely, 274084761 is an apocalyptic number.
It is an amenable number.
74084761 is a deficient number, since it is larger than the sum of its proper divisors (2389863).
74084761 is a wasteful number, since it uses less digits than its factorization.
74084761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2389862.
The product of its (nonzero) digits is 37632, while the sum is 37.
The square root of 74084761 is about 8607.2504901391. The cubic root of 74084761 is about 419.9938793515.
The spelling of 74084761 in words is "seventy-four million, eighty-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •