Base | Representation |
---|---|
bin | 111101011110001111… |
… | …0110001011100011011 |
3 | 110121202002100220120001 |
4 | 1322330132301130123 |
5 | 4130324331433311 |
6 | 140351202113431 |
7 | 12352234464001 |
oct | 1727436613433 |
9 | 417662326501 |
10 | 132011202331 |
11 | 50a92978218 |
12 | 2170234b877 |
13 | c5aa771a98 |
14 | 656463ca71 |
15 | 36796da4c1 |
hex | 1ebc7b171b |
132011202331 has 16 divisors (see below), whose sum is σ = 142804306368. Its totient is φ = 121575628800.
The previous prime is 132011202313. The next prime is 132011202341. The reversal of 132011202331 is 133202110231.
It is a cyclic number.
It is not a de Polignac number, because 132011202331 - 225 = 131977647899 is a prime.
It is a super-2 number, since 2×1320112023312 (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 = 132011202299 and 132011202308.
It is not an unprimeable number, because it can be changed into a prime (132011202341) 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 15 ways as a sum of consecutive naturals, for example, 129655 + ... + 529936.
It is an arithmetic number, because the mean of its divisors is an integer number (8925269148).
Almost surely, 2132011202331 is an apocalyptic number.
132011202331 is a deficient number, since it is larger than the sum of its proper divisors (10793104037).
132011202331 is a wasteful number, since it uses less digits than its factorization.
132011202331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659862.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132011202331 its reverse (133202110231), we get a palindrome (265213312562).
The spelling of 132011202331 in words is "one hundred thirty-two billion, eleven million, two hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •