Base | Representation |
---|---|
bin | 111101011110001111… |
… | …0000011000010011001 |
3 | 110121202002000020210222 |
4 | 1322330132003002121 |
5 | 4130324304342444 |
6 | 140351154045425 |
7 | 12352233042554 |
oct | 1727436030231 |
9 | 417662006728 |
10 | 132011012249 |
11 | 50a92858426 |
12 | 21702279875 |
13 | c5aa7063cc |
14 | 65645cd69b |
15 | 367969deee |
hex | 1ebc783099 |
132011012249 has 2 divisors, whose sum is σ = 132011012250. Its totient is φ = 132011012248.
The previous prime is 132011012213. The next prime is 132011012257. The reversal of 132011012249 is 942210110231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131359129225 + 651883024 = 362435^2 + 25532^2 .
It is a cyclic number.
It is not a de Polignac number, because 132011012249 - 212 = 132011008153 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (132011012449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66005506124 + 66005506125.
It is an arithmetic number, because the mean of its divisors is an integer number (66005506125).
Almost surely, 2132011012249 is an apocalyptic number.
It is an amenable number.
132011012249 is a deficient number, since it is larger than the sum of its proper divisors (1).
132011012249 is an equidigital number, since it uses as much as digits as its factorization.
132011012249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The spelling of 132011012249 in words is "one hundred thirty-two billion, eleven million, twelve thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •