Base | Representation |
---|---|
bin | 11110001010011001110100… |
… | …100110101101100001101001 |
3 | 122101200211010202121001002011 |
4 | 132022121310212231201221 |
5 | 114341420113422144012 |
6 | 1150045245333035521 |
7 | 36641050116015541 |
oct | 3612316446554151 |
9 | 571624122531064 |
10 | 132656316209257 |
11 | 392a5256180105 |
12 | 12a65823a85ba1 |
13 | 590358ac671a9 |
14 | 24a8858424321 |
15 | 1050a665331a7 |
hex | 78a6749ad869 |
132656316209257 has 2 divisors, whose sum is σ = 132656316209258. Its totient is φ = 132656316209256.
The previous prime is 132656316209173. The next prime is 132656316209269. The reversal of 132656316209257 is 752902613656231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80893816821801 + 51762499387456 = 8994099^2 + 7194616^2 .
It is a cyclic number.
It is not a de Polignac number, because 132656316209257 - 231 = 132654168725609 is a prime.
It is a super-3 number, since 3×1326563162092573 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (132656316206257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66328158104628 + 66328158104629.
It is an arithmetic number, because the mean of its divisors is an integer number (66328158104629).
Almost surely, 2132656316209257 is an apocalyptic number.
It is an amenable number.
132656316209257 is a deficient number, since it is larger than the sum of its proper divisors (1).
132656316209257 is an equidigital number, since it uses as much as digits as its factorization.
132656316209257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24494400, while the sum is 58.
The spelling of 132656316209257 in words is "one hundred thirty-two trillion, six hundred fifty-six billion, three hundred sixteen million, two hundred nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •