Base | Representation |
---|---|
bin | 111111010110111010… |
… | …0000001011000100001 |
3 | 111000012021001021220002 |
4 | 1332231310001120201 |
5 | 4212122340103242 |
6 | 142301035425345 |
7 | 12554460420011 |
oct | 1765564013041 |
9 | 430167037802 |
10 | 136060081697 |
11 | 52780407211 |
12 | 224522b5255 |
13 | caa45487a7 |
14 | 682a277c41 |
15 | 3814db8432 |
hex | 1fadd01621 |
136060081697 has 2 divisors, whose sum is σ = 136060081698. Its totient is φ = 136060081696.
The previous prime is 136060081679. The next prime is 136060081769. The reversal of 136060081697 is 796180060631.
It is a happy number.
Together with next prime (136060081769) it forms an Ormiston pair, because they use the same digits, order apart.
Together with previous prime (136060081679) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131878648801 + 4181432896 = 363151^2 + 64664^2 .
It is an emirp because it is prime and its reverse (796180060631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136060081697 - 226 = 135992972833 is a prime.
It is not a weakly prime, because it can be changed into another prime (136060081667) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68030040848 + 68030040849.
It is an arithmetic number, because the mean of its divisors is an integer number (68030040849).
Almost surely, 2136060081697 is an apocalyptic number.
It is an amenable number.
136060081697 is a deficient number, since it is larger than the sum of its proper divisors (1).
136060081697 is an equidigital number, since it uses as much as digits as its factorization.
136060081697 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 326592, while the sum is 47.
The spelling of 136060081697 in words is "one hundred thirty-six billion, sixty million, eighty-one thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •