Base | Representation |
---|---|
bin | 1000100110100… |
… | …0110111111110 |
3 | 2111220010000220 |
4 | 2021220313332 |
5 | 33214044100 |
6 | 3325202210 |
7 | 615453600 |
oct | 211506776 |
9 | 74803026 |
10 | 36081150 |
11 | 19404336 |
12 | 10100366 |
13 | 7623bc1 |
14 | 4b13170 |
15 | 327aaa0 |
hex | 2268dfe |
36081150 has 72 divisors (see below), whose sum is σ = 104111640. Its totient is φ = 8245440.
The previous prime is 36081137. The next prime is 36081151. The reversal of 36081150 is 5118063.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 36081150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36081151) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4896 + ... + 9804.
It is an arithmetic number, because the mean of its divisors is an integer number (1445995).
Almost surely, 236081150 is an apocalyptic number.
36081150 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 36081150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52055820).
36081150 is an abundant number, since it is smaller than the sum of its proper divisors (68030490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36081150 is a wasteful number, since it uses less digits than its factorization.
36081150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4938 (or 4926 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 24.
The square root of 36081150 is about 6006.7586933387. The cubic root of 36081150 is about 330.4406418453.
The spelling of 36081150 in words is "thirty-six million, eighty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •