Base | Representation |
---|---|
bin | 111101100001001100… |
… | …0001001110010000111 |
3 | 110121222222111222020022 |
4 | 1323002120021302013 |
5 | 4131030143132221 |
6 | 140405054325355 |
7 | 12354545402525 |
oct | 1730230116207 |
9 | 417888458208 |
10 | 132110130311 |
11 | 510337a7285 |
12 | 2172b4b985b |
13 | c5c50cb653 |
14 | 6573831315 |
15 | 368322c4ab |
hex | 1ec2609c87 |
132110130311 has 8 divisors (see below), whose sum is σ = 134522088960. Its totient is φ = 129717702072.
The previous prime is 132110130293. The next prime is 132110130319. The reversal of 132110130311 is 113031011231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132110130311 - 26 = 132110130247 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132110130311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132110130319) 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 7 ways as a sum of consecutive naturals, for example, 4868951 + ... + 4896008.
It is an arithmetic number, because the mean of its divisors is an integer number (16815261120).
Almost surely, 2132110130311 is an apocalyptic number.
132110130311 is a deficient number, since it is larger than the sum of its proper divisors (2411958649).
132110130311 is an equidigital number, since it uses as much as digits as its factorization.
132110130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9765205.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 132110130311 its reverse (113031011231), we get a palindrome (245141141542).
The spelling of 132110130311 in words is "one hundred thirty-two billion, one hundred ten million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •