Base | Representation |
---|---|
bin | 10000011101101110111111… |
… | …00101101111010001110101 |
3 | 11202012021002112001200110101 |
4 | 20032313133211233101311 |
5 | 14221144422310101013 |
6 | 205000453143554101 |
7 | 10424541121602253 |
oct | 1016673745572165 |
9 | 152167075050411 |
10 | 36206030550133 |
11 | 105999893a1234 |
12 | 4088b7a45b931 |
13 | 17282a22c2472 |
14 | 8d254a13d5d3 |
15 | 42bc068558dd |
hex | 20eddf96f475 |
36206030550133 has 16 divisors (see below), whose sum is σ = 38393924289840. Its totient is φ = 34024609529856.
The previous prime is 36206030550121. The next prime is 36206030550161. The reversal of 36206030550133 is 33105503060263.
It can be written as a sum of positive squares in 8 ways, for example, as 8282066668164 + 27923963881969 = 2877858^2 + 5284313^2 .
It is a cyclic number.
It is not a de Polignac number, because 36206030550133 - 233 = 36197440615541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 36206030550092 and 36206030550101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36206030559133) 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, 83134441 + ... + 83568817.
It is an arithmetic number, because the mean of its divisors is an integer number (2399620268115).
Almost surely, 236206030550133 is an apocalyptic number.
It is an amenable number.
36206030550133 is a deficient number, since it is larger than the sum of its proper divisors (2187893739707).
36206030550133 is a wasteful number, since it uses less digits than its factorization.
36206030550133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 441816.
The product of its (nonzero) digits is 145800, while the sum is 37.
The spelling of 36206030550133 in words is "thirty-six trillion, two hundred six billion, thirty million, five hundred fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •