Base | Representation |
---|---|
bin | 11110000010010011101110… |
… | …001011000001010010011001 |
3 | 122022201122012211100122122022 |
4 | 132002103232023001102121 |
5 | 114303311310031201131 |
6 | 1144541523512504225 |
7 | 36552624252316025 |
oct | 3602235613012231 |
9 | 568648184318568 |
10 | 132100010022041 |
11 | 391003328a9896 |
12 | 12995a4a0ab075 |
13 | 5892c92727899 |
14 | 248996315b385 |
15 | 10413575e037b |
hex | 7824ee2c1499 |
132100010022041 has 2 divisors, whose sum is σ = 132100010022042. Its totient is φ = 132100010022040.
The previous prime is 132100010022023. The next prime is 132100010022091. The reversal of 132100010022041 is 140220010001231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131106599132041 + 993410890000 = 11450179^2 + 996700^2 .
It is an emirp because it is prime and its reverse (140220010001231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132100010022041 - 218 = 132100009759897 is a prime.
It is not a weakly prime, because it can be changed into another prime (132100010022091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66050005011020 + 66050005011021.
It is an arithmetic number, because the mean of its divisors is an integer number (66050005011021).
Almost surely, 2132100010022041 is an apocalyptic number.
It is an amenable number.
132100010022041 is a deficient number, since it is larger than the sum of its proper divisors (1).
132100010022041 is an equidigital number, since it uses as much as digits as its factorization.
132100010022041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 132100010022041 its reverse (140220010001231), we get a palindrome (272320020023272).
The spelling of 132100010022041 in words is "one hundred thirty-two trillion, one hundred billion, ten million, twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •