Base | Representation |
---|---|
bin | 1000111010010… |
… | …01110100100000 |
3 | 12012122202110100 |
4 | 10131021310200 |
5 | 123114020024 |
6 | 11230102400 |
7 | 1565242500 |
oct | 435116440 |
9 | 165582410 |
10 | 74751264 |
11 | 39216805 |
12 | 2104aa00 |
13 | 12643323 |
14 | 9cdba00 |
15 | 68687c9 |
hex | 4749d20 |
74751264 has 108 divisors (see below), whose sum is σ = 247326534. Its totient is φ = 21353472.
The previous prime is 74751239. The next prime is 74751269. The reversal of 74751264 is 46215747.
It can be written as a sum of positive squares in only one way, i.e., 53406864 + 21344400 = 7308^2 + 4620^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (74751269) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 11464 + ... + 16760.
Almost surely, 274751264 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 74751264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123663267).
74751264 is an abundant number, since it is smaller than the sum of its proper divisors (172575270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74751264 is a wasteful number, since it uses less digits than its factorization.
74751264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5327 (or 5309 counting only the distinct ones).
The product of its digits is 47040, while the sum is 36.
The square root of 74751264 is about 8645.8813315937. The cubic root of 74751264 is about 421.2496117188.
The spelling of 74751264 in words is "seventy-four million, seven hundred fifty-one thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •