Base | Representation |
---|---|
bin | 111101100001001011… |
… | …1110001010100111101 |
3 | 110121222222022212211022 |
4 | 1323002113301110331 |
5 | 4131030131431031 |
6 | 140405052233525 |
7 | 12354544504505 |
oct | 1730227612475 |
9 | 417888285738 |
10 | 132110030141 |
11 | 51033738aa1 |
12 | 2172b46b8a5 |
13 | c5c5094b8b |
14 | 6573806a05 |
15 | 368320c97b |
hex | 1ec25f153d |
132110030141 has 2 divisors, whose sum is σ = 132110030142. Its totient is φ = 132110030140.
The previous prime is 132110030113. The next prime is 132110030161. The reversal of 132110030141 is 141030011231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131272159225 + 837870916 = 362315^2 + 28946^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132110030141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132110030161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66055015070 + 66055015071.
It is an arithmetic number, because the mean of its divisors is an integer number (66055015071).
Almost surely, 2132110030141 is an apocalyptic number.
It is an amenable number.
132110030141 is a deficient number, since it is larger than the sum of its proper divisors (1).
132110030141 is an equidigital number, since it uses as much as digits as its factorization.
132110030141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132110030141 its reverse (141030011231), we get a palindrome (273140041372).
The spelling of 132110030141 in words is "one hundred thirty-two billion, one hundred ten million, thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •