Base | Representation |
---|---|
bin | 11110010001000000011100… |
… | …111101100010100101100101 |
3 | 122110022012110121001121022101 |
4 | 132101000130331202211211 |
5 | 114421334002224112013 |
6 | 1151033535202532101 |
7 | 40015613446303126 |
oct | 3621003475424545 |
9 | 573265417047271 |
10 | 133110112332133 |
11 | 3945a755268892 |
12 | 12b1976b367031 |
13 | 59372ca9529b1 |
14 | 24c27c715a04d |
15 | 105c775bc38dd |
hex | 79101cf62965 |
133110112332133 has 2 divisors, whose sum is σ = 133110112332134. Its totient is φ = 133110112332132.
The previous prime is 133110112332007. The next prime is 133110112332247. The reversal of 133110112332133 is 331233211011331.
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., 67980321820324 + 65129790511809 = 8245018^2 + 8070303^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133110112332133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133110112332733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66555056166066 + 66555056166067.
It is an arithmetic number, because the mean of its divisors is an integer number (66555056166067).
Almost surely, 2133110112332133 is an apocalyptic number.
It is an amenable number.
133110112332133 is a deficient number, since it is larger than the sum of its proper divisors (1).
133110112332133 is an equidigital number, since it uses as much as digits as its factorization.
133110112332133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2916, while the sum is 28.
Adding to 133110112332133 its reverse (331233211011331), we get a palindrome (464343323343464).
The spelling of 133110112332133 in words is "one hundred thirty-three trillion, one hundred ten billion, one hundred twelve million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •