Base | Representation |
---|---|
bin | 11110000100000011100110… |
… | …001010000110000100010001 |
3 | 122100011010021112000211010011 |
4 | 132010003212022012010101 |
5 | 114312243313432133113 |
6 | 1145113031420234521 |
7 | 36564406123631500 |
oct | 3604034612060421 |
9 | 570133245024104 |
10 | 132220134646033 |
11 | 39147276043845 |
12 | 129b519369ba41 |
13 | 58a13c7697755 |
14 | 24916bac64837 |
15 | 10445384b163d |
hex | 7840e6286111 |
132220134646033 has 48 divisors (see below), whose sum is σ = 159360121557504. Its totient is φ = 109267475627520.
The previous prime is 132220134646031. The next prime is 132220134646123. The reversal of 132220134646033 is 330646431022231.
It is not a de Polignac number, because 132220134646033 - 21 = 132220134646031 is a prime.
It is not an unprimeable number, because it can be changed into a prime (132220134646031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 855589110 + ... + 855743632.
It is an arithmetic number, because the mean of its divisors is an integer number (3320002532448).
Almost surely, 2132220134646033 is an apocalyptic number.
It is an amenable number.
132220134646033 is a deficient number, since it is larger than the sum of its proper divisors (27139986911471).
132220134646033 is a wasteful number, since it uses less digits than its factorization.
132220134646033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156662 (or 156655 counting only the distinct ones).
The product of its (nonzero) digits is 373248, while the sum is 40.
Adding to 132220134646033 its reverse (330646431022231), we get a palindrome (462866565668264).
The spelling of 132220134646033 in words is "one hundred thirty-two trillion, two hundred twenty billion, one hundred thirty-four million, six hundred forty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •