Base | Representation |
---|---|
bin | 1111111001001… |
… | …00110110111111 |
3 | 100021212100211111 |
4 | 13330210312333 |
5 | 233112221002 |
6 | 21121302451 |
7 | 3206126263 |
oct | 774446677 |
9 | 307770744 |
10 | 133320127 |
11 | 6928a426 |
12 | 38794a27 |
13 | 2180ba65 |
14 | 139c60a3 |
15 | ba873d7 |
hex | 7f24dbf |
133320127 has 2 divisors, whose sum is σ = 133320128. Its totient is φ = 133320126.
The previous prime is 133320113. The next prime is 133320211. The reversal of 133320127 is 721023331.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133320127 is a prime.
It is a super-2 number, since 2×1333201272 = 35548512526592258, which contains 22 as substring.
It is a Chen prime.
It is a zygodrome in base 8.
It is a junction number, because it is equal to n+sod(n) for n = 133320098 and 133320107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133320107) 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, 66660063 + 66660064.
It is an arithmetic number, because the mean of its divisors is an integer number (66660064).
Almost surely, 2133320127 is an apocalyptic number.
133320127 is a deficient number, since it is larger than the sum of its proper divisors (1).
133320127 is an equidigital number, since it uses as much as digits as its factorization.
133320127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
The square root of 133320127 is about 11546.4335186238. The cubic root of 133320127 is about 510.8560874758.
Adding to 133320127 its reverse (721023331), we get a palindrome (854343458).
The spelling of 133320127 in words is "one hundred thirty-three million, three hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •