Base | Representation |
---|---|
bin | 11110010001011110100110… |
… | …010001101010001000001111 |
3 | 122110102022000102010222000122 |
4 | 132101132212101222020033 |
5 | 114422401300044334232 |
6 | 1151100451124415155 |
7 | 40021140536230121 |
oct | 3621364621521017 |
9 | 573368012128018 |
10 | 133142480855567 |
11 | 394724554755a7 |
12 | 12b23aa35474bb |
13 | 593a388932641 |
14 | 24c41b7d8d211 |
15 | 105d51c707312 |
hex | 7917a646a20f |
133142480855567 has 2 divisors, whose sum is σ = 133142480855568. Its totient is φ = 133142480855566.
The previous prime is 133142480855539. The next prime is 133142480855599. The reversal of 133142480855567 is 765558084241331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133142480855567 - 226 = 133142413746703 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133142480854567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66571240427783 + 66571240427784.
It is an arithmetic number, because the mean of its divisors is an integer number (66571240427784).
Almost surely, 2133142480855567 is an apocalyptic number.
133142480855567 is a deficient number, since it is larger than the sum of its proper divisors (1).
133142480855567 is an equidigital number, since it uses as much as digits as its factorization.
133142480855567 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768000, while the sum is 62.
The spelling of 133142480855567 in words is "one hundred thirty-three trillion, one hundred forty-two billion, four hundred eighty million, eight hundred fifty-five thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •