Base | Representation |
---|---|
bin | 11110000010101010011101… |
… | …010111101110111110100101 |
3 | 122022210222020021221121110001 |
4 | 132002222131113232332211 |
5 | 114304211310044013242 |
6 | 1145001042245301301 |
7 | 36554450254406455 |
oct | 3602523527567645 |
9 | 568728207847401 |
10 | 132124424204197 |
11 | 3910a720a94237 |
12 | 1299a722404831 |
13 | 589538378c809 |
14 | 248abdb7add65 |
15 | 1041cd5b46eb7 |
hex | 782a9d5eefa5 |
132124424204197 has 2 divisors, whose sum is σ = 132124424204198. Its totient is φ = 132124424204196.
The previous prime is 132124424204119. The next prime is 132124424204207. The reversal of 132124424204197 is 791402424421231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110317756407076 + 21806667797121 = 10503226^2 + 4669761^2 .
It is a cyclic number.
It is not a de Polignac number, because 132124424204197 - 231 = 132122276720549 is a prime.
It is a super-3 number, since 3×1321244242041973 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132124424201197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66062212102098 + 66062212102099.
It is an arithmetic number, because the mean of its divisors is an integer number (66062212102099).
Almost surely, 2132124424204197 is an apocalyptic number.
It is an amenable number.
132124424204197 is a deficient number, since it is larger than the sum of its proper divisors (1).
132124424204197 is an equidigital number, since it uses as much as digits as its factorization.
132124424204197 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 774144, while the sum is 46.
The spelling of 132124424204197 in words is "one hundred thirty-two trillion, one hundred twenty-four billion, four hundred twenty-four million, two hundred four thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •