Base | Representation |
---|---|
bin | 11110001010010111001110… |
… | …001001111010001111110101 |
3 | 122101200112221010212220001112 |
4 | 132022113032021322033311 |
5 | 114341343404023010313 |
6 | 1150044104254404405 |
7 | 36640620656413232 |
oct | 3612271611721765 |
9 | 571615833786045 |
10 | 132653523641333 |
11 | 392a4052909532 |
12 | 12a65184800705 |
13 | 590323453ca36 |
14 | 24a86715b6789 |
15 | 10509512b58a8 |
hex | 78a5ce27a3f5 |
132653523641333 has 2 divisors, whose sum is σ = 132653523641334. Its totient is φ = 132653523641332.
The previous prime is 132653523641273. The next prime is 132653523641339. The reversal of 132653523641333 is 333146325356231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130805723843089 + 1847799798244 = 11437033^2 + 1359338^2 .
It is a cyclic number.
It is not a de Polignac number, because 132653523641333 - 212 = 132653523637237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132653523641339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66326761820666 + 66326761820667.
It is an arithmetic number, because the mean of its divisors is an integer number (66326761820667).
Almost surely, 2132653523641333 is an apocalyptic number.
It is an amenable number.
132653523641333 is a deficient number, since it is larger than the sum of its proper divisors (1).
132653523641333 is an equidigital number, since it uses as much as digits as its factorization.
132653523641333 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10497600, while the sum is 50.
Adding to 132653523641333 its reverse (333146325356231), we get a palindrome (465799848997564).
The spelling of 132653523641333 in words is "one hundred thirty-two trillion, six hundred fifty-three billion, five hundred twenty-three million, six hundred forty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •