Base | Representation |
---|---|
bin | 111101011110110101… |
… | …1101000010111011001 |
3 | 110121210111021112021122 |
4 | 1322331223220113121 |
5 | 4130400011201413 |
6 | 140353202015025 |
7 | 12352600650146 |
oct | 1727553502731 |
9 | 417714245248 |
10 | 132031350233 |
11 | 50aa3289682 |
12 | 21709047475 |
13 | c5b19a7613 |
14 | 65671a53cd |
15 | 367b36a108 |
hex | 1ebdae85d9 |
132031350233 has 2 divisors, whose sum is σ = 132031350234. Its totient is φ = 132031350232.
The previous prime is 132031350193. The next prime is 132031350251. The reversal of 132031350233 is 332053130231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 116272816144 + 15758534089 = 340988^2 + 125533^2 .
It is a cyclic number.
It is not a de Polignac number, because 132031350233 - 26 = 132031350169 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 (132031350433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66015675116 + 66015675117.
It is an arithmetic number, because the mean of its divisors is an integer number (66015675117).
Almost surely, 2132031350233 is an apocalyptic number.
It is an amenable number.
132031350233 is a deficient number, since it is larger than the sum of its proper divisors (1).
132031350233 is an equidigital number, since it uses as much as digits as its factorization.
132031350233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 26.
Adding to 132031350233 its reverse (332053130231), we get a palindrome (464084480464).
The spelling of 132031350233 in words is "one hundred thirty-two billion, thirty-one million, three hundred fifty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •