Base | Representation |
---|---|
bin | 11110000101101111101001… |
… | …010110011110110111000101 |
3 | 122100120012201222210102102001 |
4 | 132011233221112132313011 |
5 | 114321143414444420312 |
6 | 1145242220014145301 |
7 | 36605654136032104 |
oct | 3605575126366705 |
9 | 570505658712361 |
10 | 132336152341957 |
11 | 391914a1000973 |
12 | 12a137717b2231 |
13 | 58ac326817b75 |
14 | 249716534203b |
15 | 1047578a3a057 |
hex | 785be959edc5 |
132336152341957 has 2 divisors, whose sum is σ = 132336152341958. Its totient is φ = 132336152341956.
The previous prime is 132336152341901. The next prime is 132336152342059. The reversal of 132336152341957 is 759143251633231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121933405183716 + 10402747158241 = 11042346^2 + 3225329^2 .
It is a cyclic number.
It is not a de Polignac number, because 132336152341957 - 231 = 132334004858309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132336152341898 and 132336152341907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132336152041957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66168076170978 + 66168076170979.
It is an arithmetic number, because the mean of its divisors is an integer number (66168076170979).
Almost surely, 2132336152341957 is an apocalyptic number.
It is an amenable number.
132336152341957 is a deficient number, since it is larger than the sum of its proper divisors (1).
132336152341957 is an equidigital number, since it uses as much as digits as its factorization.
132336152341957 is an evil number, because the sum of its binary digits is even.
The product of its digits is 12247200, while the sum is 55.
The spelling of 132336152341957 in words is "one hundred thirty-two trillion, three hundred thirty-six billion, one hundred fifty-two million, three hundred forty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •