Base | Representation |
---|---|
bin | 111101100001110100… |
… | …0100111001000001111 |
3 | 110122001110012112122010 |
4 | 1323003220213020033 |
5 | 4131101043101111 |
6 | 140411130352303 |
7 | 12355222566444 |
oct | 1730350471017 |
9 | 418043175563 |
10 | 132131222031 |
11 | 510446a2856 |
12 | 2173658b693 |
13 | c5c95a4963 |
14 | 65765619cb |
15 | 3684ee6aa6 |
hex | 1ec3a2720f |
132131222031 has 16 divisors (see below), whose sum is σ = 180291488256. Its totient is φ = 86029660416.
The previous prime is 132131222029. The next prime is 132131222039. The reversal of 132131222031 is 130222131231.
It is not a de Polignac number, because 132131222031 - 21 = 132131222029 is a prime.
It is a super-2 number, since 2×1321312220312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132131221989 and 132131222007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132131222039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1268671 + ... + 1368863.
It is an arithmetic number, because the mean of its divisors is an integer number (11268218016).
Almost surely, 2132131222031 is an apocalyptic number.
132131222031 is a deficient number, since it is larger than the sum of its proper divisors (48160266225).
132131222031 is a wasteful number, since it uses less digits than its factorization.
132131222031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110462.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 132131222031 its reverse (130222131231), we get a palindrome (262353353262).
The spelling of 132131222031 in words is "one hundred thirty-two billion, one hundred thirty-one million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •