Base | Representation |
---|---|
bin | 11110010011100110… |
… | …100100110110110101 |
3 | 10002222211212220020212 |
4 | 132103212210312311 |
5 | 1013121012244021 |
6 | 22541005235205 |
7 | 2231254035356 |
oct | 362346446665 |
9 | 102884786225 |
10 | 32541134261 |
11 | 12889692899 |
12 | 6381b62b05 |
13 | 30b799743c |
14 | 1809b25d2d |
15 | ca6c7c85b |
hex | 7939a4db5 |
32541134261 has 2 divisors, whose sum is σ = 32541134262. Its totient is φ = 32541134260.
The previous prime is 32541134191. The next prime is 32541134293. The reversal of 32541134261 is 16243114523.
It is an a-pointer prime, because the next prime (32541134293) can be obtained adding 32541134261 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19660246225 + 12880888036 = 140215^2 + 113494^2 .
It is a cyclic number.
It is not a de Polignac number, because 32541134261 - 234 = 15361265077 is a prime.
It is a super-2 number, since 2×325411342612 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32541137261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16270567130 + 16270567131.
It is an arithmetic number, because the mean of its divisors is an integer number (16270567131).
Almost surely, 232541134261 is an apocalyptic number.
It is an amenable number.
32541134261 is a deficient number, since it is larger than the sum of its proper divisors (1).
32541134261 is an equidigital number, since it uses as much as digits as its factorization.
32541134261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 17280, while the sum is 32.
Adding to 32541134261 its reverse (16243114523), we get a palindrome (48784248784).
The spelling of 32541134261 in words is "thirty-two billion, five hundred forty-one million, one hundred thirty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •