Base | Representation |
---|---|
bin | 11110010001001001110111… |
… | …111101101010111111110011 |
3 | 122110100011120122101222211111 |
4 | 132101021313331222333303 |
5 | 114422020212112342302 |
6 | 1151042331114454151 |
7 | 40016422241634556 |
oct | 3621116775527763 |
9 | 573304518358744 |
10 | 133120229027827 |
11 | 39463a76938018 |
12 | 12b1b713434357 |
13 | 593825087b072 |
14 | 24c30a69b869d |
15 | 105cb68e330d7 |
hex | 791277f6aff3 |
133120229027827 has 2 divisors, whose sum is σ = 133120229027828. Its totient is φ = 133120229027826.
The previous prime is 133120229027719. The next prime is 133120229027837. The reversal of 133120229027827 is 728720922021331.
It is a strong prime.
It is an emirp because it is prime and its reverse (728720922021331) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133120229027827 is a prime.
It is a super-2 number, since 2×1331202290278272 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133120229027837) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66560114513913 + 66560114513914.
It is an arithmetic number, because the mean of its divisors is an integer number (66560114513914).
Almost surely, 2133120229027827 is an apocalyptic number.
133120229027827 is a deficient number, since it is larger than the sum of its proper divisors (1).
133120229027827 is an equidigital number, since it uses as much as digits as its factorization.
133120229027827 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1016064, while the sum is 49.
The spelling of 133120229027827 in words is "one hundred thirty-three trillion, one hundred twenty billion, two hundred twenty-nine million, twenty-seven thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •