Base | Representation |
---|---|
bin | 11110000100101101101100… |
… | …001101011110101100010001 |
3 | 122100022102221111101001012202 |
4 | 132010231230031132230101 |
5 | 114314013400314300413 |
6 | 1145145504425332545 |
7 | 36600566155411163 |
oct | 3604555415365421 |
9 | 570272844331182 |
10 | 132265333353233 |
11 | 3916445a589513 |
12 | 12a01aa8637155 |
13 | 58a574b7cc602 |
14 | 2493967a5a933 |
15 | 10457d15a0e58 |
hex | 784b6c35eb11 |
132265333353233 has 8 divisors (see below), whose sum is σ = 132397356991848. Its totient is φ = 132133334068224.
The previous prime is 132265333353229. The next prime is 132265333353253. The reversal of 132265333353233 is 332353333562231.
It can be written as a sum of positive squares in 4 ways, for example, as 283101677329 + 131982231675904 = 532073^2 + 11488352^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132265333353233 - 22 = 132265333353229 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132265333353253) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4788785 + ... + 16954737.
It is an arithmetic number, because the mean of its divisors is an integer number (16549669623981).
Almost surely, 2132265333353233 is an apocalyptic number.
It is an amenable number.
132265333353233 is a deficient number, since it is larger than the sum of its proper divisors (132023638615).
132265333353233 is a wasteful number, since it uses less digits than its factorization.
132265333353233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12176803.
The product of its digits is 7873200, while the sum is 47.
The spelling of 132265333353233 in words is "one hundred thirty-two trillion, two hundred sixty-five billion, three hundred thirty-three million, three hundred fifty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •