Base | Representation |
---|---|
bin | 11110000101100001101110… |
… | …110011000000101111110011 |
3 | 122100111210011201121221012202 |
4 | 132011201232303000233303 |
5 | 114320422320044240311 |
6 | 1145231305244213415 |
7 | 36604614653326154 |
oct | 3605415663005763 |
9 | 570453151557182 |
10 | 132321211321331 |
11 | 39186124202a3a |
12 | 12a108a1b3a26b |
13 | 58aaab527c366 |
14 | 2496548cb192b |
15 | 1046ea1ec5e3b |
hex | 78586ecc0bf3 |
132321211321331 has 2 divisors, whose sum is σ = 132321211321332. Its totient is φ = 132321211321330.
The previous prime is 132321211321291. The next prime is 132321211321363. The reversal of 132321211321331 is 133123112123231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132321211321331 is a prime.
It is a super-2 number, since 2×1323212113213312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132321211321294 and 132321211321303.
It is not a weakly prime, because it can be changed into another prime (132321211371331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66160605660665 + 66160605660666.
It is an arithmetic number, because the mean of its divisors is an integer number (66160605660666).
Almost surely, 2132321211321331 is an apocalyptic number.
132321211321331 is a deficient number, since it is larger than the sum of its proper divisors (1).
132321211321331 is an equidigital number, since it uses as much as digits as its factorization.
132321211321331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3888, while the sum is 29.
Adding to 132321211321331 its reverse (133123112123231), we get a palindrome (265444323444562).
The spelling of 132321211321331 in words is "one hundred thirty-two trillion, three hundred twenty-one billion, two hundred eleven million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •