Base | Representation |
---|---|
bin | 1000100111000… |
… | …0001101111110 |
3 | 2111221122021222 |
4 | 2021300031332 |
5 | 33221024410 |
6 | 3325553342 |
7 | 615640361 |
oct | 211601576 |
9 | 74848258 |
10 | 36111230 |
11 | 194249a1 |
12 | 10115852 |
13 | 76347bc |
14 | 4b200d8 |
15 | 3284955 |
hex | 227037e |
36111230 has 16 divisors (see below), whose sum is σ = 68824080. Its totient is φ = 13594752.
The previous prime is 36111221. The next prime is 36111233. The reversal of 36111230 is 3211163.
36111230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×361112302 = 2608041864225800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a junction number, because it is equal to n+sod(n) for n = 36111199 and 36111208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36111233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106040 + ... + 106379.
It is an arithmetic number, because the mean of its divisors is an integer number (4301505).
Almost surely, 236111230 is an apocalyptic number.
36111230 is a deficient number, since it is larger than the sum of its proper divisors (32712850).
36111230 is a wasteful number, since it uses less digits than its factorization.
36111230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212443.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 36111230 is about 6009.2620179187. The cubic root of 36111230 is about 330.5324431842.
Adding to 36111230 its reverse (3211163), we get a palindrome (39322393).
The spelling of 36111230 in words is "thirty-six million, one hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •