Base | Representation |
---|---|
bin | 11111111101000… |
… | …110110000000111 |
3 | 1101100210022121000 |
4 | 133331012300013 |
5 | 2044221042020 |
6 | 125110424343 |
7 | 16166610066 |
oct | 3775066007 |
9 | 1340708530 |
10 | 536112135 |
11 | 255691a89 |
12 | 12b6620b3 |
13 | 870ba120 |
14 | 512b61dd |
15 | 320ed090 |
hex | 1ff46c07 |
536112135 has 32 divisors (see below), whose sum is σ = 1026406080. Its totient is φ = 263931264.
The previous prime is 536112131. The next prime is 536112163. The reversal of 536112135 is 531211635.
536112135 is a `hidden beast` number, since 536 + 1 + 121 + 3 + 5 = 666.
It is not a de Polignac number, because 536112135 - 22 = 536112131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 536112099 and 536112108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (536112131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 150984 + ... + 154493.
It is an arithmetic number, because the mean of its divisors is an integer number (32075190).
Almost surely, 2536112135 is an apocalyptic number.
536112135 is a deficient number, since it is larger than the sum of its proper divisors (490293945).
536112135 is a wasteful number, since it uses less digits than its factorization.
536112135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 305504 (or 305498 counting only the distinct ones).
The product of its digits is 2700, while the sum is 27.
The square root of 536112135 is about 23154.0954260796. The cubic root of 536112135 is about 812.3662631164.
The spelling of 536112135 in words is "five hundred thirty-six million, one hundred twelve thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •