Base | Representation |
---|---|
bin | 11111111100111… |
… | …000110101011111 |
3 | 1101100200102101220 |
4 | 133330320311133 |
5 | 2044212231020 |
6 | 125105304423 |
7 | 16166251650 |
oct | 3774706537 |
9 | 1340612356 |
10 | 536055135 |
11 | 255653180 |
12 | 12b635113 |
13 | 8709a1b5 |
14 | 5129d527 |
15 | 320db240 |
hex | 1ff38d5f |
536055135 has 128 divisors (see below), whose sum is σ = 1182449664. Its totient is φ = 200386560.
The previous prime is 536055119. The next prime is 536055199. The reversal of 536055135 is 531550635.
536055135 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 536055135 - 24 = 536055119 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 536055096 and 536055105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 451012 + ... + 452198.
It is an arithmetic number, because the mean of its divisors is an integer number (9237888).
Almost surely, 2536055135 is an apocalyptic number.
536055135 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
536055135 is an abundant number, since it is smaller than the sum of its proper divisors (646394529).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
536055135 is a wasteful number, since it uses less digits than its factorization.
536055135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1253.
The product of its (nonzero) digits is 33750, while the sum is 33.
The square root of 536055135 is about 23152.8645096023. The cubic root of 536055135 is about 812.3374715539.
The spelling of 536055135 in words is "five hundred thirty-six million, fifty-five thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •