Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0110111111011001011 |
3 | 110122020022112200222222 |
4 | 1323013302313323023 |
5 | 4131221430134011 |
6 | 140422102404255 |
7 | 12360031065404 |
oct | 1730762677313 |
9 | 418208480888 |
10 | 132201021131 |
11 | 51080036963 |
12 | 21755a3068b |
13 | c60aba2bba |
14 | 65819309ab |
15 | 368b1d2ddb |
hex | 1ec7cb7ecb |
132201021131 has 8 divisors (see below), whose sum is σ = 132806776080. Its totient is φ = 131595471648.
The previous prime is 132201021119. The next prime is 132201021143. The reversal of 132201021131 is 131120102231.
It is an interprime number because it is at equal distance from previous prime (132201021119) and next prime (132201021143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132201021131 is a prime.
It is a super-2 number, since 2×1322010211312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132201021031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1322165 + ... + 1418633.
It is an arithmetic number, because the mean of its divisors is an integer number (16600847010).
Almost surely, 2132201021131 is an apocalyptic number.
132201021131 is a deficient number, since it is larger than the sum of its proper divisors (605754949).
132201021131 is an equidigital number, since it uses as much as digits as its factorization.
132201021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102733.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132201021131 its reverse (131120102231), we get a palindrome (263321123362).
The spelling of 132201021131 in words is "one hundred thirty-two billion, two hundred one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •