Base | Representation |
---|---|
bin | 11110110101100111011100… |
… | …110100111010101011011111 |
3 | 122210012201010021020201021201 |
4 | 132311213130310322223133 |
5 | 120234043304103241101 |
6 | 1200241401124340331 |
7 | 40365434626454425 |
oct | 3665473464725337 |
9 | 583181107221251 |
10 | 135625887165151 |
11 | 3a23a6855aa649 |
12 | 132652572446a7 |
13 | 5a8a60a561846 |
14 | 256c483d0b115 |
15 | 10a2e1964de01 |
hex | 7b59dcd3aadf |
135625887165151 has 2 divisors, whose sum is σ = 135625887165152. Its totient is φ = 135625887165150.
The previous prime is 135625887165073. The next prime is 135625887165211. The reversal of 135625887165151 is 151561788526531.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 135625887165151 - 27 = 135625887165023 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (135625887165551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67812943582575 + 67812943582576.
It is an arithmetic number, because the mean of its divisors is an integer number (67812943582576).
Almost surely, 2135625887165151 is an apocalyptic number.
135625887165151 is a deficient number, since it is larger than the sum of its proper divisors (1).
135625887165151 is an equidigital number, since it uses as much as digits as its factorization.
135625887165151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 60480000, while the sum is 64.
The spelling of 135625887165151 in words is "one hundred thirty-five trillion, six hundred twenty-five billion, eight hundred eighty-seven million, one hundred sixty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •