Base | Representation |
---|---|
bin | 11110000011000011100000… |
… | …000100100101100110111101 |
3 | 122022220112122020002010111201 |
4 | 132003003200010211212331 |
5 | 114310131342120443313 |
6 | 1145021250343015501 |
7 | 36556421506054045 |
oct | 3603034004454675 |
9 | 568815566063451 |
10 | 132151313062333 |
11 | 3912006a056344 |
12 | 129a398743a591 |
13 | 5897a7a428366 |
14 | 248c22c960725 |
15 | 104285b5760dd |
hex | 7830e01259bd |
132151313062333 has 2 divisors, whose sum is σ = 132151313062334. Its totient is φ = 132151313062332.
The previous prime is 132151313062313. The next prime is 132151313062339. The reversal of 132151313062333 is 333260313151231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100799130175129 + 31352182887204 = 10039877^2 + 5599302^2 .
It is a cyclic number.
It is not a de Polignac number, because 132151313062333 - 225 = 132151279507901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132151313062292 and 132151313062301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132151313062339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075656531166 + 66075656531167.
It is an arithmetic number, because the mean of its divisors is an integer number (66075656531167).
Almost surely, 2132151313062333 is an apocalyptic number.
It is an amenable number.
132151313062333 is a deficient number, since it is larger than the sum of its proper divisors (1).
132151313062333 is an equidigital number, since it uses as much as digits as its factorization.
132151313062333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 37.
The spelling of 132151313062333 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, three hundred thirteen million, sixty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •