Base | Representation |
---|---|
bin | 111110000001110000… |
… | …1100010110011001001 |
3 | 110201211011011011000202 |
4 | 1330003201202303021 |
5 | 4140244444023423 |
6 | 141105340541545 |
7 | 12423616522502 |
oct | 1740341426311 |
9 | 421734134022 |
10 | 133203111113 |
11 | 515447579a6 |
12 | 219955518b5 |
13 | c73a692457 |
14 | 6638a63ba9 |
15 | 36e9178728 |
hex | 1f03862cc9 |
133203111113 has 4 divisors (see below), whose sum is σ = 133204348368. Its totient is φ = 133201873860.
The previous prime is 133203111101. The next prime is 133203111229. The reversal of 133203111113 is 311111302331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 133203111113 - 26 = 133203111049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133203111413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 439931 + ... + 678192.
It is an arithmetic number, because the mean of its divisors is an integer number (33301087092).
Almost surely, 2133203111113 is an apocalyptic number.
It is an amenable number.
133203111113 is a deficient number, since it is larger than the sum of its proper divisors (1237255).
133203111113 is a wasteful number, since it uses less digits than its factorization.
133203111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1237254.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 133203111113 its reverse (311111302331), we get a palindrome (444314413444).
The spelling of 133203111113 in words is "one hundred thirty-three billion, two hundred three million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •