Base | Representation |
---|---|
bin | 10000001111011… |
… | …10100110010001 |
3 | 100111100220002022 |
4 | 20013232212101 |
5 | 234334243401 |
6 | 21304101225 |
7 | 3243023444 |
oct | 1007564621 |
9 | 314326068 |
10 | 136243601 |
11 | 6a9a691a |
12 | 39764815 |
13 | 222c3620 |
14 | 1414765b |
15 | be6371b |
hex | 81ee991 |
136243601 has 4 divisors (see below), whose sum is σ = 146723892. Its totient is φ = 125763312.
The previous prime is 136243589. The next prime is 136243619. The reversal of 136243601 is 106342631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 106342631 = 383 ⋅277657.
It can be written as a sum of positive squares in 2 ways, for example, as 7398400 + 128845201 = 2720^2 + 11351^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136243601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136243621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5240126 + ... + 5240151.
It is an arithmetic number, because the mean of its divisors is an integer number (36680973).
Almost surely, 2136243601 is an apocalyptic number.
It is an amenable number.
136243601 is a deficient number, since it is larger than the sum of its proper divisors (10480291).
136243601 is a wasteful number, since it uses less digits than its factorization.
136243601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10480290.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 136243601 is about 11672.3434236660. The cubic root of 136243601 is about 514.5631775234.
The spelling of 136243601 in words is "one hundred thirty-six million, two hundred forty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •