Base | Representation |
---|---|
bin | 11110000011000010011010… |
… | …011001111001011011010101 |
3 | 122022220102121202201222101002 |
4 | 132003002122121321123111 |
5 | 114310121443411242123 |
6 | 1145020534351113045 |
7 | 36556350524213522 |
oct | 3603023231713325 |
9 | 568812552658332 |
10 | 132150144243413 |
11 | 3911a61a30739a |
12 | 129a36bbb12785 |
13 | 589792223062a |
14 | 248c15b62a149 |
15 | 10427ddb49528 |
hex | 78309a6796d5 |
132150144243413 has 2 divisors, whose sum is σ = 132150144243414. Its totient is φ = 132150144243412.
The previous prime is 132150144243391. The next prime is 132150144243421. The reversal of 132150144243413 is 314342441051231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73428069484324 + 58722074759089 = 8569018^2 + 7663033^2 .
It is a cyclic number.
It is not a de Polignac number, because 132150144243413 - 226 = 132150077134549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132150104243413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075072121706 + 66075072121707.
It is an arithmetic number, because the mean of its divisors is an integer number (66075072121707).
Almost surely, 2132150144243413 is an apocalyptic number.
It is an amenable number.
132150144243413 is a deficient number, since it is larger than the sum of its proper divisors (1).
132150144243413 is an equidigital number, since it uses as much as digits as its factorization.
132150144243413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 132150144243413 its reverse (314342441051231), we get a palindrome (446492585294644).
The spelling of 132150144243413 in words is "one hundred thirty-two trillion, one hundred fifty billion, one hundred forty-four million, two hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •