Base | Representation |
---|---|
bin | 11110000010100110101001… |
… | …011001110010101101111101 |
3 | 122022210120200001001112022011 |
4 | 132002212221121302231331 |
5 | 114304124414230244401 |
6 | 1144555124152051221 |
7 | 36554243653543225 |
oct | 3602465131625575 |
9 | 568716601045264 |
10 | 132120331103101 |
11 | 39108a105a0860 |
12 | 1299997b693b11 |
13 | 5894b807a17c3 |
14 | 248a92dd43085 |
15 | 1041b46631451 |
hex | 7829a9672b7d |
132120331103101 has 16 divisors (see below), whose sum is σ = 148544190305280. Its totient is φ = 116472149100720.
The previous prime is 132120331103093. The next prime is 132120331103297. The reversal of 132120331103101 is 101301133021231.
It is a cyclic number.
It is not a de Polignac number, because 132120331103101 - 23 = 132120331103093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132120331103801) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1004697445 + ... + 1004828938.
It is an arithmetic number, because the mean of its divisors is an integer number (9284011894080).
Almost surely, 2132120331103101 is an apocalyptic number.
132120331103101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132120331103101 is a deficient number, since it is larger than the sum of its proper divisors (16423859202179).
132120331103101 is a wasteful number, since it uses less digits than its factorization.
132120331103101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2009526576.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 132120331103101 its reverse (101301133021231), we get a palindrome (233421464124332).
The spelling of 132120331103101 in words is "one hundred thirty-two trillion, one hundred twenty billion, three hundred thirty-one million, one hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •