Base | Representation |
---|---|
bin | 11110000000110110100111… |
… | …000001001011000000000001 |
3 | 122022101002011012002102112101 |
4 | 132000312213001023000001 |
5 | 114300142031143311431 |
6 | 1144423551053030401 |
7 | 36542454563250043 |
oct | 3600664701130001 |
9 | 568332135072471 |
10 | 132000032010241 |
11 | 3907199892185a |
12 | 1297a5a7785401 |
13 | 588671b646515 |
14 | 2484b9adc1a93 |
15 | 103d95529a961 |
hex | 780da704b001 |
132000032010241 has 2 divisors, whose sum is σ = 132000032010242. Its totient is φ = 132000032010240.
The previous prime is 132000032010173. The next prime is 132000032010263. The reversal of 132000032010241 is 142010230000231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 123596671699216 + 8403360311025 = 11117404^2 + 2898855^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132000032010241 is a prime.
It is not a weakly prime, because it can be changed into another prime (132000032010281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66000016005120 + 66000016005121.
It is an arithmetic number, because the mean of its divisors is an integer number (66000016005121).
Almost surely, 2132000032010241 is an apocalyptic number.
It is an amenable number.
132000032010241 is a deficient number, since it is larger than the sum of its proper divisors (1).
132000032010241 is an equidigital number, since it uses as much as digits as its factorization.
132000032010241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 132000032010241 its reverse (142010230000231), we get a palindrome (274010262010472).
The spelling of 132000032010241 in words is "one hundred thirty-two trillion, thirty-two million, ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •