Base | Representation |
---|---|
bin | 11110000101001111000111… |
… | …010011101011001100000101 |
3 | 122100102212120121010212100001 |
4 | 132011033013103223030011 |
5 | 114320110400142123214 |
6 | 1145214201515521301 |
7 | 36603306413214403 |
oct | 3605170723531405 |
9 | 570385517125301 |
10 | 132301221442309 |
11 | 391786a6466a67 |
12 | 12a08a43459231 |
13 | 58a8c4aa0938a |
14 | 24955b00a2473 |
15 | 10466d20a8c74 |
hex | 7853c74eb305 |
132301221442309 has 2 divisors, whose sum is σ = 132301221442310. Its totient is φ = 132301221442308.
The previous prime is 132301221442297. The next prime is 132301221442333. The reversal of 132301221442309 is 903244122103231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77802543330625 + 54498678111684 = 8820575^2 + 7382322^2 .
It is a cyclic number.
It is not a de Polignac number, because 132301221442309 - 25 = 132301221442277 is a prime.
It is a super-2 number, since 2×1323012214423092 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132301221442109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66150610721154 + 66150610721155.
It is an arithmetic number, because the mean of its divisors is an integer number (66150610721155).
Almost surely, 2132301221442309 is an apocalyptic number.
It is an amenable number.
132301221442309 is a deficient number, since it is larger than the sum of its proper divisors (1).
132301221442309 is an equidigital number, since it uses as much as digits as its factorization.
132301221442309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 132301221442309 in words is "one hundred thirty-two trillion, three hundred one billion, two hundred twenty-one million, four hundred forty-two thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.488 sec. • engine limits •