Base | Representation |
---|---|
bin | 111101100001001111… |
… | …1110010001111010111 |
3 | 110122000010021121201001 |
4 | 1323002133302033113 |
5 | 4131031201143111 |
6 | 140405205244131 |
7 | 12354601404526 |
oct | 1730237621727 |
9 | 418003247631 |
10 | 132112131031 |
11 | 51034943471 |
12 | 21730103647 |
13 | c5c564c1ca |
14 | 6573bd24bd |
15 | 36834c51c1 |
hex | 1ec27f23d7 |
132112131031 has 8 divisors (see below), whose sum is σ = 137868302304. Its totient is φ = 126356973600.
The previous prime is 132112130981. The next prime is 132112131043. The reversal of 132112131031 is 130131211231.
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 132112131031 - 27 = 132112130903 is a prime.
It is a super-2 number, since 2×1321121310312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132112131061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19081 + ... + 514381.
It is an arithmetic number, because the mean of its divisors is an integer number (17233537788).
Almost surely, 2132112131031 is an apocalyptic number.
132112131031 is a deficient number, since it is larger than the sum of its proper divisors (5756171273).
132112131031 is a wasteful number, since it uses less digits than its factorization.
132112131031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506921.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 132112131031 its reverse (130131211231), we get a palindrome (262243342262).
The spelling of 132112131031 in words is "one hundred thirty-two billion, one hundred twelve million, one hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.959 sec. • engine limits •