Base | Representation |
---|---|
bin | 111111100101111101… |
… | …0110000110001011011 |
3 | 111001111110110012010112 |
4 | 1333023322300301123 |
5 | 4214141140241042 |
6 | 142423121234535 |
7 | 12603132515345 |
oct | 1771372606133 |
9 | 431443405115 |
10 | 136565165147 |
11 | 52a0a525954 |
12 | 22573492a4b |
13 | cb55090638 |
14 | 6877394295 |
15 | 38443d7982 |
hex | 1fcbeb0c5b |
136565165147 has 4 divisors (see below), whose sum is σ = 137640481536. Its totient is φ = 135489848760.
The previous prime is 136565165101. The next prime is 136565165159. The reversal of 136565165147 is 741561565631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 741561565631 = 1129 ⋅656830439.
It is a cyclic number.
It is not a de Polignac number, because 136565165147 - 26 = 136565165083 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 136565165095 and 136565165104.
It is not an unprimeable number, because it can be changed into a prime (136565165747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 537658004 + ... + 537658257.
It is an arithmetic number, because the mean of its divisors is an integer number (34410120384).
Almost surely, 2136565165147 is an apocalyptic number.
136565165147 is a deficient number, since it is larger than the sum of its proper divisors (1075316389).
136565165147 is a wasteful number, since it uses less digits than its factorization.
136565165147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1075316388.
The product of its digits is 2268000, while the sum is 50.
The spelling of 136565165147 in words is "one hundred thirty-six billion, five hundred sixty-five million, one hundred sixty-five thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •