Base | Representation |
---|---|
bin | 11110000011111100000111… |
… | …110111010001000111110011 |
3 | 122100010100120021121210101112 |
4 | 132003330013313101013303 |
5 | 114312130400202420311 |
6 | 1145105223244423535 |
7 | 36564003225161126 |
oct | 3603740767210763 |
9 | 570110507553345 |
10 | 132212110201331 |
11 | 3914392849a766 |
12 | 129b3714247bab |
13 | 58a0719076114 |
14 | 24911592363bd |
15 | 1044218c8828b |
hex | 783f07dd11f3 |
132212110201331 has 2 divisors, whose sum is σ = 132212110201332. Its totient is φ = 132212110201330.
The previous prime is 132212110201279. The next prime is 132212110201343. The reversal of 132212110201331 is 133102011212231.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132212110201331 - 218 = 132212109939187 is a prime.
It is a super-2 number, since 2×1322121102013312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132212110201297 and 132212110201306.
It is not a weakly prime, because it can be changed into another prime (132212110201931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66106055100665 + 66106055100666.
It is an arithmetic number, because the mean of its divisors is an integer number (66106055100666).
Almost surely, 2132212110201331 is an apocalyptic number.
132212110201331 is a deficient number, since it is larger than the sum of its proper divisors (1).
132212110201331 is an equidigital number, since it uses as much as digits as its factorization.
132212110201331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 132212110201331 its reverse (133102011212231), we get a palindrome (265314121413562).
The spelling of 132212110201331 in words is "one hundred thirty-two trillion, two hundred twelve billion, one hundred ten million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •