Base | Representation |
---|---|
bin | 11110111011101001100001… |
… | …101000110001110010111111 |
3 | 122211200100010121220002012012 |
4 | 132323221201220301302333 |
5 | 120312341301121310213 |
6 | 1201200040051401435 |
7 | 40440411505312331 |
oct | 3673514150616277 |
9 | 584610117802165 |
10 | 136040432213183 |
11 | 3a38a4724658a3 |
12 | 133116695b327b |
13 | 5aba7333a7284 |
14 | 258456bb07451 |
15 | 10adacce414a8 |
hex | 7bba61a31cbf |
136040432213183 has 4 divisors (see below), whose sum is σ = 136354613350368. Its totient is φ = 135726251076000.
The previous prime is 136040432213113. The next prime is 136040432213237. The reversal of 136040432213183 is 381312234040631.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136040432213183 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136040432213183.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136040432213113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 157090567943 + ... + 157090568808.
It is an arithmetic number, because the mean of its divisors is an integer number (34088653337592).
Almost surely, 2136040432213183 is an apocalyptic number.
136040432213183 is a deficient number, since it is larger than the sum of its proper divisors (314181137185).
136040432213183 is an equidigital number, since it uses as much as digits as its factorization.
136040432213183 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 314181137184.
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 136040432213183 in words is "one hundred thirty-six trillion, forty billion, four hundred thirty-two million, two hundred thirteen thousand, one hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •