Base | Representation |
---|---|
bin | 11110001010010111010110… |
… | …011110011001101010000101 |
3 | 122101200120021212112202112021 |
4 | 132022113112132121222011 |
5 | 114341344200241334342 |
6 | 1150044130202323141 |
7 | 36640624303043065 |
oct | 3612272636315205 |
9 | 571616255482467 |
10 | 132653663230597 |
11 | 392a411468aa63 |
12 | 12a652034b94b1 |
13 | 5903257435132 |
14 | 24a8685d513a5 |
15 | 105095d68a567 |
hex | 78a5d6799a85 |
132653663230597 has 2 divisors, whose sum is σ = 132653663230598. Its totient is φ = 132653663230596.
The previous prime is 132653663230549. The next prime is 132653663230609. The reversal of 132653663230597 is 795032366356231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132596860135041 + 56803095556 = 11515071^2 + 238334^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132653663230597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132653663230537) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66326831615298 + 66326831615299.
It is an arithmetic number, because the mean of its divisors is an integer number (66326831615299).
Almost surely, 2132653663230597 is an apocalyptic number.
It is an amenable number.
132653663230597 is a deficient number, since it is larger than the sum of its proper divisors (1).
132653663230597 is an equidigital number, since it uses as much as digits as its factorization.
132653663230597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110224800, while the sum is 61.
The spelling of 132653663230597 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, six hundred sixty-three million, two hundred thirty thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •