Base | Representation |
---|---|
bin | 11110000100000011110000… |
… | …010001010010111111010111 |
3 | 122100011010201100021110000122 |
4 | 132010003300101102333113 |
5 | 114312244140400244020 |
6 | 1145113100320502155 |
7 | 36564413254003403 |
oct | 3604036021227727 |
9 | 570133640243018 |
10 | 132220304306135 |
11 | 39147352893a01 |
12 | 129b522047a95b |
13 | 58a142388b146 |
14 | 24916d55ca103 |
15 | 1044548326125 |
hex | 7840f0452fd7 |
132220304306135 has 16 divisors (see below), whose sum is σ = 158680511764992. Its totient is φ = 105765479769600.
The previous prime is 132220304306117. The next prime is 132220304306141. The reversal of 132220304306135 is 531603403022231.
It is not a de Polignac number, because 132220304306135 - 212 = 132220304302039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132220304306095 and 132220304306104.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3605563850 + ... + 3605600520.
It is an arithmetic number, because the mean of its divisors is an integer number (9917531985312).
Almost surely, 2132220304306135 is an apocalyptic number.
132220304306135 is a deficient number, since it is larger than the sum of its proper divisors (26460207458857).
132220304306135 is a wasteful number, since it uses less digits than its factorization.
132220304306135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90394.
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 132220304306135 its reverse (531603403022231), we get a palindrome (663823707328366).
The spelling of 132220304306135 in words is "one hundred thirty-two trillion, two hundred twenty billion, three hundred four million, three hundred six thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •