Base | Representation |
---|---|
bin | 11110010000001110100100… |
… | …000111000000010110100111 |
3 | 122110010002012101222110002202 |
4 | 132100032210013000112213 |
5 | 114414444301030201123 |
6 | 1150553155532325115 |
7 | 40012006141003313 |
oct | 3620164407002647 |
9 | 573102171873082 |
10 | 133056545162663 |
11 | 39439a66a705a1 |
12 | 12b0b2bb91379b |
13 | 5932241b59305 |
14 | 24bdd84b84b43 |
15 | 105b18d0a4a28 |
hex | 7903a41c05a7 |
133056545162663 has 4 divisors (see below), whose sum is σ = 137644701892440. Its totient is φ = 128468388432888.
The previous prime is 133056545162633. The next prime is 133056545162669. The reversal of 133056545162663 is 366261545650331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133056545162663 - 26 = 133056545162599 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133056545162599 and 133056545162608.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133056545162669) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2294078364845 + ... + 2294078364902.
It is an arithmetic number, because the mean of its divisors is an integer number (34411175473110).
Almost surely, 2133056545162663 is an apocalyptic number.
133056545162663 is a deficient number, since it is larger than the sum of its proper divisors (4588156729777).
133056545162663 is an equidigital number, since it uses as much as digits as its factorization.
133056545162663 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4588156729776.
The product of its (nonzero) digits is 34992000, while the sum is 56.
The spelling of 133056545162663 in words is "one hundred thirty-three trillion, fifty-six billion, five hundred forty-five million, one hundred sixty-two thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •