Base | Representation |
---|---|
bin | 11110010000001010011000… |
… | …001011111001001101111001 |
3 | 122110002122121010211011022002 |
4 | 132100022120023321031321 |
5 | 114414411044314302030 |
6 | 1150551133520510345 |
7 | 40011456560015021 |
oct | 3620123013711571 |
9 | 573078533734262 |
10 | 133052050150265 |
11 | 3943806a717214 |
12 | 12b0a46647b3b5 |
13 | 59319a680aa6c |
14 | 24bda79bb6a81 |
15 | 105aec864e245 |
hex | 7902982f9379 |
133052050150265 has 4 divisors (see below), whose sum is σ = 159662460180324. Its totient is φ = 106441640120208.
The previous prime is 133052050150237. The next prime is 133052050150273. The reversal of 133052050150265 is 562051050250331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14118979095529 + 118933071054736 = 3757523^2 + 10905644^2 .
It is a cyclic number.
It is not a de Polignac number, because 133052050150265 - 214 = 133052050133881 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 13305205015022 + ... + 13305205015031.
It is an arithmetic number, because the mean of its divisors is an integer number (39915615045081).
Almost surely, 2133052050150265 is an apocalyptic number.
It is an amenable number.
133052050150265 is a deficient number, since it is larger than the sum of its proper divisors (26610410030059).
133052050150265 is an equidigital number, since it uses as much as digits as its factorization.
133052050150265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26610410030058.
The product of its (nonzero) digits is 135000, while the sum is 38.
The spelling of 133052050150265 in words is "one hundred thirty-three trillion, fifty-two billion, fifty million, one hundred fifty thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •