Base | Representation |
---|---|
bin | 1000101001101… |
… | …0111011001000 |
3 | 2112021112020120 |
4 | 2022122323020 |
5 | 33242124102 |
6 | 3333423240 |
7 | 620266350 |
oct | 212327310 |
9 | 75245216 |
10 | 36286152 |
11 | 19534361 |
12 | 1019ab20 |
13 | 76962c6 |
14 | 4b67b60 |
15 | 32bb6bc |
hex | 229aec8 |
36286152 has 64 divisors (see below), whose sum is σ = 106106880. Its totient is φ = 10124352.
The previous prime is 36286147. The next prime is 36286153. The reversal of 36286152 is 25168263.
It is a super-3 number, since 3×362861523 (a number of 24 digits) contains 333 as substring.
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 not an unprimeable number, because it can be changed into a prime (36286153) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4713 + ... + 9735.
It is an arithmetic number, because the mean of its divisors is an integer number (1657920).
Almost surely, 236286152 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 36286152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53053440).
36286152 is an abundant number, since it is smaller than the sum of its proper divisors (69820728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36286152 is a wasteful number, since it uses less digits than its factorization.
36286152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5082 (or 5078 counting only the distinct ones).
The product of its digits is 17280, while the sum is 33.
The square root of 36286152 is about 6023.7988014209. The cubic root of 36286152 is about 331.0652810396.
The spelling of 36286152 in words is "thirty-six million, two hundred eighty-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •