Base | Representation |
---|---|
bin | 111111011000101100… |
… | …0101000101100010111 |
3 | 111000100102211001012000 |
4 | 1332301120220230113 |
5 | 4212233210332133 |
6 | 142311020130343 |
7 | 12556116002415 |
oct | 1766130505427 |
9 | 430312731160 |
10 | 136120011543 |
11 | 5280121a40a |
12 | 2246a3969b3 |
13 | cab3a9c839 |
14 | 68341d82b5 |
15 | 381a2a5413 |
hex | 1fb1628b17 |
136120011543 has 8 divisors (see below), whose sum is σ = 201659276400. Its totient is φ = 90746674344.
The previous prime is 136120011541. The next prime is 136120011569. The reversal of 136120011543 is 345110021631.
It is a happy number.
136120011543 is a `hidden beast` number, since 1 + 3 + 612 + 0 + 0 + 1 + 1 + 5 + 43 = 666.
It is not a de Polignac number, because 136120011543 - 21 = 136120011541 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 5041481909 = 136120011543 / (1 + 3 + 6 + 1 + 2 + 0 + 0 + 1 + 1 + 5 + 4 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136120011541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2520740928 + ... + 2520740981.
It is an arithmetic number, because the mean of its divisors is an integer number (25207409550).
Almost surely, 2136120011543 is an apocalyptic number.
136120011543 is a deficient number, since it is larger than the sum of its proper divisors (65539264857).
136120011543 is an equidigital number, since it uses as much as digits as its factorization.
136120011543 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5041481918 (or 5041481912 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The spelling of 136120011543 in words is "one hundred thirty-six billion, one hundred twenty million, eleven thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •