Base | Representation |
---|---|
bin | 111111101010000001… |
… | …1001110100100110101 |
3 | 111001211222011220110001 |
4 | 1333110003032210311 |
5 | 4214431102231401 |
6 | 142444433431301 |
7 | 12606410305621 |
oct | 1772403164465 |
9 | 431758156401 |
10 | 136701602101 |
11 | 52a7a543a69 |
12 | 225b110b531 |
13 | cb77420c6c |
14 | 688b54c181 |
15 | 3851388601 |
hex | 1fd40ce935 |
136701602101 has 2 divisors, whose sum is σ = 136701602102. Its totient is φ = 136701602100.
The previous prime is 136701602077. The next prime is 136701602119. The reversal of 136701602101 is 101206107631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98218933201 + 38482668900 = 313399^2 + 196170^2 .
It is a cyclic number.
It is not a de Polignac number, because 136701602101 - 213 = 136701593909 is a prime.
It is a super-2 number, since 2×1367016021012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 136701602101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136701602171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68350801050 + 68350801051.
It is an arithmetic number, because the mean of its divisors is an integer number (68350801051).
Almost surely, 2136701602101 is an apocalyptic number.
It is an amenable number.
136701602101 is a deficient number, since it is larger than the sum of its proper divisors (1).
136701602101 is an equidigital number, since it uses as much as digits as its factorization.
136701602101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 28.
Adding to 136701602101 its reverse (101206107631), we get a palindrome (237907709732).
The spelling of 136701602101 in words is "one hundred thirty-six billion, seven hundred one million, six hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •