Base | Representation |
---|---|
bin | 11110000011001100111100… |
… | …111011111100111011001101 |
3 | 122022221111211110020111110122 |
4 | 132003030330323330323031 |
5 | 114310313133004423341 |
6 | 1145030045332514325 |
7 | 36560231131165442 |
oct | 3603147473747315 |
9 | 568844743214418 |
10 | 132161461014221 |
11 | 391243a7333841 |
12 | 129a5939a7b9a5 |
13 | 5898a06978412 |
14 | 248c9125d79c9 |
15 | 1042c5240b94b |
hex | 78333cefcecd |
132161461014221 has 2 divisors, whose sum is σ = 132161461014222. Its totient is φ = 132161461014220.
The previous prime is 132161461014203. The next prime is 132161461014259. The reversal of 132161461014221 is 122410164161231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128961347893225 + 3200113120996 = 11356115^2 + 1788886^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132161461014221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132161469014221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66080730507110 + 66080730507111.
It is an arithmetic number, because the mean of its divisors is an integer number (66080730507111).
Almost surely, 2132161461014221 is an apocalyptic number.
It is an amenable number.
132161461014221 is a deficient number, since it is larger than the sum of its proper divisors (1).
132161461014221 is an equidigital number, since it uses as much as digits as its factorization.
132161461014221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 35.
The spelling of 132161461014221 in words is "one hundred thirty-two trillion, one hundred sixty-one billion, four hundred sixty-one million, fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •