Base | Representation |
---|---|
bin | 11110000011111101000011… |
… | …100101101011010101100101 |
3 | 122100010110011010002202211001 |
4 | 132003331003211223111211 |
5 | 114312134423212114302 |
6 | 1145105510521313301 |
7 | 36564040113212254 |
oct | 3603750345532545 |
9 | 570113133082731 |
10 | 132213112223077 |
11 | 391442a2074506 |
12 | 129b3953935831 |
13 | 58a08488405b2 |
14 | 249121234c79b |
15 | 1044276c18787 |
hex | 783f4396b565 |
132213112223077 has 2 divisors, whose sum is σ = 132213112223078. Its totient is φ = 132213112223076.
The previous prime is 132213112223069. The next prime is 132213112223113. The reversal of 132213112223077 is 770322211312231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131827460044996 + 385652178081 = 11481614^2 + 621009^2 .
It is a cyclic number.
It is not a de Polignac number, because 132213112223077 - 23 = 132213112223069 is a prime.
It is a super-3 number, since 3×1322131122230773 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132213112223057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66106556111538 + 66106556111539.
It is an arithmetic number, because the mean of its divisors is an integer number (66106556111539).
Almost surely, 2132213112223077 is an apocalyptic number.
It is an amenable number.
132213112223077 is a deficient number, since it is larger than the sum of its proper divisors (1).
132213112223077 is an equidigital number, since it uses as much as digits as its factorization.
132213112223077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 42336, while the sum is 37.
The spelling of 132213112223077 in words is "one hundred thirty-two trillion, two hundred thirteen billion, one hundred twelve million, two hundred twenty-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •