Base | Representation |
---|---|
bin | 111111010111110100… |
… | …0000101010100100111 |
3 | 111000021101022000220221 |
4 | 1332233220011110213 |
5 | 4212203132202120 |
6 | 142304043505211 |
7 | 12555310135114 |
oct | 1765750052447 |
9 | 430241260827 |
10 | 136090506535 |
11 | 527965a7905 |
12 | 22460528207 |
13 | caaa93bc59 |
14 | 683031790b |
15 | 38178c80aa |
hex | 1fafa05527 |
136090506535 has 16 divisors (see below), whose sum is σ = 172323702720. Its totient is φ = 102968715520.
The previous prime is 136090506533. The next prime is 136090506593. The reversal of 136090506535 is 535605090631.
It is not a de Polignac number, because 136090506535 - 21 = 136090506533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136090506491 and 136090506500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136090506533) 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, 6638056 + ... + 6658525.
It is an arithmetic number, because the mean of its divisors is an integer number (10770231420).
Almost surely, 2136090506535 is an apocalyptic number.
136090506535 is a deficient number, since it is larger than the sum of its proper divisors (36233196185).
136090506535 is a wasteful number, since it uses less digits than its factorization.
136090506535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13296698.
The product of its (nonzero) digits is 364500, while the sum is 43.
The spelling of 136090506535 in words is "one hundred thirty-six billion, ninety million, five hundred six thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •