Base | Representation |
---|---|
bin | 111101100111001001… |
… | …0101011010001101111 |
3 | 110122111220122111000201 |
4 | 1323032102223101233 |
5 | 4131432331134411 |
6 | 140440554534331 |
7 | 12362523424063 |
oct | 1731622532157 |
9 | 418456574021 |
10 | 132310021231 |
11 | 51126615293 |
12 | 217864373a7 |
13 | c6276480bb |
14 | 65921c5aa3 |
15 | 3695a643c1 |
hex | 1ece4ab46f |
132310021231 has 4 divisors (see below), whose sum is σ = 136578086464. Its totient is φ = 128041956000.
The previous prime is 132310021229. The next prime is 132310021241. The reversal of 132310021231 is 132120013231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132310021231 - 21 = 132310021229 is a prime.
It is a super-2 number, since 2×1323100212312 (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 = 132310021199 and 132310021208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132310021241) 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, 2134032570 + ... + 2134032631.
It is an arithmetic number, because the mean of its divisors is an integer number (34144521616).
Almost surely, 2132310021231 is an apocalyptic number.
132310021231 is a deficient number, since it is larger than the sum of its proper divisors (4268065233).
132310021231 is an equidigital number, since it uses as much as digits as its factorization.
132310021231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4268065232.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132310021231 its reverse (132120013231), we get a palindrome (264430034462).
The spelling of 132310021231 in words is "one hundred thirty-two billion, three hundred ten million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •