Base | Representation |
---|---|
bin | 11110000100000011100101… |
… | …010110000111111100010111 |
3 | 122100011010020120101122202220 |
4 | 132010003211112013330113 |
5 | 114312243301440202411 |
6 | 1145113030212233423 |
7 | 36564405600060114 |
oct | 3604034526077427 |
9 | 570133216348686 |
10 | 132220121022231 |
11 | 39147269389000 |
12 | 129b518b00b873 |
13 | 58a13c4907628 |
14 | 24916b911990b |
15 | 10445371beb06 |
hex | 7840e5587f17 |
132220121022231 has 32 divisors (see below), whose sum is σ = 195829496591616. Its totient is φ = 79340006372000.
The previous prime is 132220121022221. The next prime is 132220121022239.
132220121022231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 132220121022231 - 26 = 132220121022167 is a prime.
It is a super-2 number, since 2×1322201210222312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132220121022239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 163522341 + ... + 164328926.
It is an arithmetic number, because the mean of its divisors is an integer number (6119671768488).
Almost surely, 2132220121022231 is an apocalyptic number.
132220121022231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132220121022231 is a deficient number, since it is larger than the sum of its proper divisors (63609375569385).
132220121022231 is a wasteful number, since it uses less digits than its factorization.
132220121022231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 327851404 (or 327851382 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The spelling of 132220121022231 in words is "one hundred thirty-two trillion, two hundred twenty billion, one hundred twenty-one million, twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •