Base | Representation |
---|---|
bin | 1000110110001… |
… | …11111100111000 |
3 | 12011122201202201 |
4 | 10123013330320 |
5 | 123000004240 |
6 | 11210435544 |
7 | 1560565600 |
oct | 433077470 |
9 | 164581681 |
10 | 74219320 |
11 | 3899308a |
12 | 20a32bb4 |
13 | 124b8176 |
14 | 9bddc00 |
15 | 67b0d9a |
hex | 46c7f38 |
74219320 has 96 divisors (see below), whose sum is σ = 204584400. Its totient is φ = 24095232.
The previous prime is 74219291. The next prime is 74219329. The reversal of 74219320 is 2391247.
It is a super-2 number, since 2×742193202 = 11017014922524800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74219329) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36244 + ... + 38236.
Almost surely, 274219320 is an apocalyptic number.
74219320 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 74219320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102292200).
74219320 is an abundant number, since it is smaller than the sum of its proper divisors (130365080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74219320 is a wasteful number, since it uses less digits than its factorization.
74219320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2037 (or 2026 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 74219320 is about 8615.0635517099. The cubic root of 74219320 is about 420.2480016792.
The spelling of 74219320 in words is "seventy-four million, two hundred nineteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •