Base | Representation |
---|---|
bin | 111101100000111100… |
… | …1101001000110100101 |
3 | 110121222102110121210111 |
4 | 1323001321221012211 |
5 | 4131021121212013 |
6 | 140404211053021 |
7 | 12354420411316 |
oct | 1730171510645 |
9 | 417872417714 |
10 | 132102132133 |
11 | 5102a234114 |
12 | 217288a1171 |
13 | c5c355acba |
14 | 657274c60d |
15 | 368269c73d |
hex | 1ec1e691a5 |
132102132133 has 2 divisors, whose sum is σ = 132102132134. Its totient is φ = 132102132132.
The previous prime is 132102132119. The next prime is 132102132137. The reversal of 132102132133 is 331231201231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107228741764 + 24873390369 = 327458^2 + 157713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132102132133 is a prime.
It is a super-2 number, since 2×1321021321332 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132102132137) 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, 66051066066 + 66051066067.
It is an arithmetic number, because the mean of its divisors is an integer number (66051066067).
Almost surely, 2132102132133 is an apocalyptic number.
It is an amenable number.
132102132133 is a deficient number, since it is larger than the sum of its proper divisors (1).
132102132133 is an equidigital number, since it uses as much as digits as its factorization.
132102132133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 132102132133 its reverse (331231201231), we get a palindrome (463333333364).
The spelling of 132102132133 in words is "one hundred thirty-two billion, one hundred two million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •