Base | Representation |
---|---|
bin | 111101100100110011… |
… | …0100000010111010011 |
3 | 110122022102120201112001 |
4 | 1323021212200113103 |
5 | 4131302210131311 |
6 | 140425104214431 |
7 | 12360546534226 |
oct | 1731146402723 |
9 | 418272521461 |
10 | 132231333331 |
11 | 5109615a969 |
12 | 2176400a417 |
13 | c614257006 |
14 | 65859815bd |
15 | 368dbbe4c1 |
hex | 1ec99a05d3 |
132231333331 has 2 divisors, whose sum is σ = 132231333332. Its totient is φ = 132231333330.
The previous prime is 132231333329. The next prime is 132231333343. The reversal of 132231333331 is 133333132231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132231333331 - 21 = 132231333329 is a prime.
It is a super-2 number, since 2×1322313333312 (a number of 23 digits) contains 22 as substring.
Together with 132231333329, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 132231333331.
It is not a weakly prime, because it can be changed into another prime (132231337331) 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 as a sum of consecutive naturals, namely, 66115666665 + 66115666666.
It is an arithmetic number, because the mean of its divisors is an integer number (66115666666).
Almost surely, 2132231333331 is an apocalyptic number.
132231333331 is a deficient number, since it is larger than the sum of its proper divisors (1).
132231333331 is an equidigital number, since it uses as much as digits as its factorization.
132231333331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8748, while the sum is 28.
Adding to 132231333331 its reverse (133333132231), we get a palindrome (265564465562).
The spelling of 132231333331 in words is "one hundred thirty-two billion, two hundred thirty-one million, three hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •