Base | Representation |
---|---|
bin | 1000111110010… |
… | …01100000100000 |
3 | 12020122022220000 |
4 | 10133021200200 |
5 | 123232234042 |
6 | 11245220000 |
7 | 1602551343 |
oct | 437114040 |
9 | 166568800 |
10 | 75274272 |
11 | 39543747 |
12 | 21261600 |
13 | 127973b8 |
14 | 9dd645a |
15 | 691d74c |
hex | 47c9820 |
75274272 has 120 divisors (see below), whose sum is σ = 224207676. Its totient is φ = 24772608.
The previous prime is 75274253. The next prime is 75274289. The reversal of 75274272 is 27247257.
It can be written as a sum of positive squares in 2 ways, for example, as 75272976 + 1296 = 8676^2 + 36^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (54880) is a multiple of the sum of its prime factors (392).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 292768 + ... + 293024.
Almost surely, 275274272 is an apocalyptic number.
75274272 is a gapful number since it is divisible by the number (72) 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 75274272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112103838).
75274272 is an abundant number, since it is smaller than the sum of its proper divisors (148933404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75274272 is a wasteful number, since it uses less digits than its factorization.
75274272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 392 (or 375 counting only the distinct ones).
The product of its digits is 54880, while the sum is 36.
The square root of 75274272 is about 8676.0746884752. The cubic root of 75274272 is about 422.2297738672.
The spelling of 75274272 in words is "seventy-five million, two hundred seventy-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •