Base | Representation |
---|---|
bin | 111101100001100000… |
… | …1101111001010100101 |
3 | 110122000202000210121212 |
4 | 1323003001233022211 |
5 | 4131040441000313 |
6 | 140410124121205 |
7 | 12355040144114 |
oct | 1730301571245 |
9 | 418022023555 |
10 | 132121031333 |
11 | 51039972395 |
12 | 21733096205 |
13 | c5c7447365 |
14 | 657506bc7b |
15 | 36841823a8 |
hex | 1ec306f2a5 |
132121031333 has 2 divisors, whose sum is σ = 132121031334. Its totient is φ = 132121031332.
The previous prime is 132121031311. The next prime is 132121031347. The reversal of 132121031333 is 333130121231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131448303364 + 672727969 = 362558^2 + 25937^2 .
It is a cyclic number.
It is not a de Polignac number, because 132121031333 - 230 = 131047289509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132121031299 and 132121031308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132121031233) 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, 66060515666 + 66060515667.
It is an arithmetic number, because the mean of its divisors is an integer number (66060515667).
Almost surely, 2132121031333 is an apocalyptic number.
It is an amenable number.
132121031333 is a deficient number, since it is larger than the sum of its proper divisors (1).
132121031333 is an equidigital number, since it uses as much as digits as its factorization.
132121031333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 132121031333 its reverse (333130121231), we get a palindrome (465251152564).
The spelling of 132121031333 in words is "one hundred thirty-two billion, one hundred twenty-one million, thirty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •