Base | Representation |
---|---|
bin | 111101100111110001… |
… | …1001000101001000111 |
3 | 110122120101100001112111 |
4 | 1323033203020221013 |
5 | 4132003231104111 |
6 | 140443031001451 |
7 | 12363200621155 |
oct | 1731743105107 |
9 | 418511301474 |
10 | 132331113031 |
11 | 51137510927 |
12 | 21791509287 |
13 | c62bb21460 |
14 | 6594d163d5 |
15 | 369782da21 |
hex | 1ecf8c8a47 |
132331113031 has 4 divisors (see below), whose sum is σ = 142510429432. Its totient is φ = 122151796632.
The previous prime is 132331113017. The next prime is 132331113119. The reversal of 132331113031 is 130311133231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132331113031 is a prime.
It is a super-2 number, since 2×1323311130312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132331112993 and 132331113011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132331113931) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5089658181 + ... + 5089658206.
It is an arithmetic number, because the mean of its divisors is an integer number (35627607358).
Almost surely, 2132331113031 is an apocalyptic number.
132331113031 is a deficient number, since it is larger than the sum of its proper divisors (10179316401).
132331113031 is a wasteful number, since it uses less digits than its factorization.
132331113031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10179316400.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 132331113031 its reverse (130311133231), we get a palindrome (262642246262).
The spelling of 132331113031 in words is "one hundred thirty-two billion, three hundred thirty-one million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •