Base | Representation |
---|---|
bin | 11110111111110101100101… |
… | …110001011101111011011101 |
3 | 122212200212002010221121020121 |
4 | 132333311211301131323131 |
5 | 120332100241142040142 |
6 | 1201540201242314541 |
7 | 40500251323515436 |
oct | 3677654561357335 |
9 | 585625063847217 |
10 | 136328264408797 |
11 | 3a49054620860a |
12 | 133593b7ab8a51 |
13 | 5b0b91437a516 |
14 | 2594474c2a48d |
15 | 10b6327284c67 |
hex | 7bfd65c5dedd |
136328264408797 has 2 divisors, whose sum is σ = 136328264408798. Its totient is φ = 136328264408796.
The previous prime is 136328264408779. The next prime is 136328264408837. The reversal of 136328264408797 is 797804462823631.
Together with previous prime (136328264408779) 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., 133391088844036 + 2937175564761 = 11549506^2 + 1713819^2 .
It is a cyclic number.
It is not a de Polignac number, because 136328264408797 - 211 = 136328264406749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136328264438797) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68164132204398 + 68164132204399.
It is an arithmetic number, because the mean of its divisors is an integer number (68164132204399).
Almost surely, 2136328264408797 is an apocalyptic number.
It is an amenable number.
136328264408797 is a deficient number, since it is larger than the sum of its proper divisors (1).
136328264408797 is an equidigital number, since it uses as much as digits as its factorization.
136328264408797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 585252864, while the sum is 70.
The spelling of 136328264408797 in words is "one hundred thirty-six trillion, three hundred twenty-eight billion, two hundred sixty-four million, four hundred eight thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •