Base | Representation |
---|---|
bin | 11110000010110001100001… |
… | …101000111101101101100111 |
3 | 122022211200211002202201112102 |
4 | 132002301201220331231213 |
5 | 114304322330034211011 |
6 | 1145004335222442315 |
7 | 36555136301661215 |
oct | 3602614150755547 |
9 | 568750732681472 |
10 | 132132012022631 |
11 | 39112965126565 |
12 | 129a009b59339b |
13 | 5895cc27b77ca |
14 | 248b31b421cb5 |
15 | 10420cbd7473b |
hex | 782c61a3db67 |
132132012022631 has 2 divisors, whose sum is σ = 132132012022632. Its totient is φ = 132132012022630.
The previous prime is 132132012022603. The next prime is 132132012022771. The reversal of 132132012022631 is 136220210231231.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132132012022631 is a prime.
It is a super-2 number, since 2×1321320120226312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132132012022594 and 132132012022603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132132012022831) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66066006011315 + 66066006011316.
It is an arithmetic number, because the mean of its divisors is an integer number (66066006011316).
Almost surely, 2132132012022631 is an apocalyptic number.
132132012022631 is a deficient number, since it is larger than the sum of its proper divisors (1).
132132012022631 is an equidigital number, since it uses as much as digits as its factorization.
132132012022631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 132132012022631 its reverse (136220210231231), we get a palindrome (268352222253862).
The spelling of 132132012022631 in words is "one hundred thirty-two trillion, one hundred thirty-two billion, twelve million, twenty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •