Base | Representation |
---|---|
bin | 11110000100000011110001… |
… | …000000010001011011001101 |
3 | 122100011010202012110002010222 |
4 | 132010003301000101123031 |
5 | 114312244202023323433 |
6 | 1145113101440441125 |
7 | 36564413463452333 |
oct | 3604036100213315 |
9 | 570133665402128 |
10 | 132220316620493 |
11 | 39147359834962 |
12 | 129b52246191a5 |
13 | 58a14262b024a |
14 | 24916d70b3b53 |
15 | 1044549459b98 |
hex | 7840f10116cd |
132220316620493 has 2 divisors, whose sum is σ = 132220316620494. Its totient is φ = 132220316620492.
The previous prime is 132220316620477. The next prime is 132220316620531. The reversal of 132220316620493 is 394026613022231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119064476718889 + 13155839901604 = 10911667^2 + 3627098^2 .
It is a cyclic number.
It is not a de Polignac number, because 132220316620493 - 24 = 132220316620477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132220316620423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110158310246 + 66110158310247.
It is an arithmetic number, because the mean of its divisors is an integer number (66110158310247).
Almost surely, 2132220316620493 is an apocalyptic number.
It is an amenable number.
132220316620493 is a deficient number, since it is larger than the sum of its proper divisors (1).
132220316620493 is an equidigital number, since it uses as much as digits as its factorization.
132220316620493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 559872, while the sum is 44.
The spelling of 132220316620493 in words is "one hundred thirty-two trillion, two hundred twenty billion, three hundred sixteen million, six hundred twenty thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •