Base | Representation |
---|---|
bin | 1000101001011… |
… | …1111111010000 |
3 | 2112020220202020 |
4 | 2022113333100 |
5 | 33241233003 |
6 | 3333251440 |
7 | 620216322 |
oct | 212277720 |
9 | 75226666 |
10 | 36274128 |
11 | 19526320 |
12 | 10193b80 |
13 | 76909a7 |
14 | 4b63612 |
15 | 32b7d53 |
hex | 2297fd0 |
36274128 has 160 divisors (see below), whose sum is σ = 111421440. Its totient is φ = 10053120.
The previous prime is 36274111. The next prime is 36274129. The reversal of 36274128 is 82147263.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
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 (36274129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 352125 + ... + 352227.
It is an arithmetic number, because the mean of its divisors is an integer number (696384).
Almost surely, 236274128 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 36274128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55710720).
36274128 is an abundant number, since it is smaller than the sum of its proper divisors (75147312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36274128 is a wasteful number, since it uses less digits than its factorization.
36274128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177 (or 171 counting only the distinct ones).
The product of its digits is 16128, while the sum is 33.
The square root of 36274128 is about 6022.8006774257. The cubic root of 36274128 is about 331.0287090648.
The spelling of 36274128 in words is "thirty-six million, two hundred seventy-four thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •