Base | Representation |
---|---|
bin | 111111011110101100… |
… | …0001100011010110001 |
3 | 111000212110102121111001 |
4 | 1332331120030122301 |
5 | 4213141213103241 |
6 | 142343004522001 |
7 | 12564111161644 |
oct | 1767530143261 |
9 | 430773377431 |
10 | 136321222321 |
11 | 528a485a009 |
12 | 22505850301 |
13 | cb1668bc7b |
14 | 6852c13a5b |
15 | 382cc9d431 |
hex | 1fbd60c6b1 |
136321222321 has 2 divisors, whose sum is σ = 136321222322. Its totient is φ = 136321222320.
The previous prime is 136321222291. The next prime is 136321222337. The reversal of 136321222321 is 123222123631.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90413874721 + 45907347600 = 300689^2 + 214260^2 .
It is an emirp because it is prime and its reverse (123222123631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 136321222321 - 221 = 136319125169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 136321222321.
It is not a weakly prime, because it can be changed into another prime (136321222421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68160611160 + 68160611161.
It is an arithmetic number, because the mean of its divisors is an integer number (68160611161).
Almost surely, 2136321222321 is an apocalyptic number.
It is an amenable number.
136321222321 is a deficient number, since it is larger than the sum of its proper divisors (1).
136321222321 is an equidigital number, since it uses as much as digits as its factorization.
136321222321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 28.
Adding to 136321222321 its reverse (123222123631), we get a palindrome (259543345952).
The spelling of 136321222321 in words is "one hundred thirty-six billion, three hundred twenty-one million, two hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •