Base | Representation |
---|---|
bin | 11110000100000011100110… |
… | …001000000101101001011111 |
3 | 122100011010021111001002120121 |
4 | 132010003212020011221133 |
5 | 114312243313313320111 |
6 | 1145113031401055411 |
7 | 36564406116311116 |
oct | 3604034610055137 |
9 | 570133244032517 |
10 | 132220134120031 |
11 | 39147275814631 |
12 | 129b5193487567 |
13 | 58a13c75421c9 |
14 | 24916bab68c7d |
15 | 104453840a871 |
hex | 7840e6205a5f |
132220134120031 has 2 divisors, whose sum is σ = 132220134120032. Its totient is φ = 132220134120030.
The previous prime is 132220134119993. The next prime is 132220134120073. The reversal of 132220134120031 is 130021431022231.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132220134120031 is a prime.
It is a super-2 number, since 2×1322201341200312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132220134119978 and 132220134120005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132220134100031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110067060015 + 66110067060016.
It is an arithmetic number, because the mean of its divisors is an integer number (66110067060016).
Almost surely, 2132220134120031 is an apocalyptic number.
132220134120031 is a deficient number, since it is larger than the sum of its proper divisors (1).
132220134120031 is an equidigital number, since it uses as much as digits as its factorization.
132220134120031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 132220134120031 its reverse (130021431022231), we get a palindrome (262241565142262).
The spelling of 132220134120031 in words is "one hundred thirty-two trillion, two hundred twenty billion, one hundred thirty-four million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •