Base | Representation |
---|---|
bin | 10000001110010… |
… | …11110111011111 |
3 | 100111002122221111 |
4 | 20013023313133 |
5 | 234320220333 |
6 | 21301042451 |
7 | 3241561630 |
oct | 1007136737 |
9 | 314078844 |
10 | 136101343 |
11 | 6a909a54 |
12 | 396b6427 |
13 | 22273951 |
14 | 1410b887 |
15 | be364cd |
hex | 81cbddf |
136101343 has 4 divisors (see below), whose sum is σ = 155544400. Its totient is φ = 116658288.
The previous prime is 136101323. The next prime is 136101367. The reversal of 136101343 is 343101631.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 343101631 = 467 ⋅734693.
It is a cyclic number.
It is not a de Polignac number, because 136101343 - 25 = 136101311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136101323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9721518 + ... + 9721531.
It is an arithmetic number, because the mean of its divisors is an integer number (38886100).
Almost surely, 2136101343 is an apocalyptic number.
136101343 is a deficient number, since it is larger than the sum of its proper divisors (19443057).
136101343 is an equidigital number, since it uses as much as digits as its factorization.
136101343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19443056.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 136101343 is about 11666.2480258222. The cubic root of 136101343 is about 514.3840223921.
Adding to 136101343 its reverse (343101631), we get a palindrome (479202974).
The spelling of 136101343 in words is "one hundred thirty-six million, one hundred one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •