Base | Representation |
---|---|
bin | 11110000100000011100101… |
… | …011110110101101010010011 |
3 | 122100011010020201200201101202 |
4 | 132010003211132311222103 |
5 | 114312243303031303033 |
6 | 1145113030333221415 |
7 | 36564405625353161 |
oct | 3604034536655223 |
9 | 570133221621352 |
10 | 132220123306643 |
11 | 3914726a6a9349 |
12 | 129b518b93186b |
13 | 58a13c5227358 |
14 | 24916b9552231 |
15 | 10445374c18e8 |
hex | 7840e57b5a93 |
132220123306643 has 2 divisors, whose sum is σ = 132220123306644. Its totient is φ = 132220123306642.
The previous prime is 132220123306633. The next prime is 132220123306651. The reversal of 132220123306643 is 346603321022231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132220123306643 - 28 = 132220123306387 is a prime.
It is a super-2 number, since 2×1322201233066432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132220123306597 and 132220123306606.
It is not a weakly prime, because it can be changed into another prime (132220123306633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110061653321 + 66110061653322.
It is an arithmetic number, because the mean of its divisors is an integer number (66110061653322).
Almost surely, 2132220123306643 is an apocalyptic number.
132220123306643 is a deficient number, since it is larger than the sum of its proper divisors (1).
132220123306643 is an equidigital number, since it uses as much as digits as its factorization.
132220123306643 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 186624, while the sum is 38.
Adding to 132220123306643 its reverse (346603321022231), we get a palindrome (478823444328874).
The spelling of 132220123306643 in words is "one hundred thirty-two trillion, two hundred twenty billion, one hundred twenty-three million, three hundred six thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •