Base | Representation |
---|---|
bin | 1000111011100… |
… | …00101000111000 |
3 | 12012221211120020 |
4 | 10131300220320 |
5 | 123134112024 |
6 | 11233330440 |
7 | 1566504162 |
oct | 435605070 |
9 | 165854506 |
10 | 74910264 |
11 | 39315210 |
12 | 21106a20 |
13 | 1269a800 |
14 | 9d3d932 |
15 | 689a979 |
hex | 4770a38 |
74910264 has 192 divisors, whose sum is σ = 234005760. Its totient is φ = 19768320.
The previous prime is 74910263. The next prime is 74910317. The reversal of 74910264 is 46201947.
It is a happy number.
It is a super-2 number, since 2×749102642 = 11223095305099392, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74910263) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1026132 + ... + 1026204.
It is an arithmetic number, because the mean of its divisors is an integer number (1218780).
Almost surely, 274910264 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 74910264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117002880).
74910264 is an abundant number, since it is smaller than the sum of its proper divisors (159095496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74910264 is a wasteful number, since it uses less digits than its factorization.
74910264 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142 (or 125 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 33.
The square root of 74910264 is about 8655.0715768271. The cubic root of 74910264 is about 421.5480738077.
The spelling of 74910264 in words is "seventy-four million, nine hundred ten thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •