Base | Representation |
---|---|
bin | 111101111011110001… |
… | …1101000101110101111 |
3 | 110201022011100120101011 |
4 | 1323313203220232233 |
5 | 4134342044124403 |
6 | 141033405330051 |
7 | 12415631115043 |
oct | 1736743505657 |
9 | 421264316334 |
10 | 133002333103 |
11 | 51451393462 |
12 | 2193a266927 |
13 | c707bc4cb3 |
14 | 661a11c023 |
15 | 36d6718a6d |
hex | 1ef78e8baf |
133002333103 has 4 divisors (see below), whose sum is σ = 133883143408. Its totient is φ = 132121522800.
The previous prime is 133002333089. The next prime is 133002333157. The reversal of 133002333103 is 301333200331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301333200331 = 4057 ⋅74274883.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133002333103 is a prime.
It is a super-2 number, since 2×1330023331032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133002334103) 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, 440404926 + ... + 440405227.
It is an arithmetic number, because the mean of its divisors is an integer number (33470785852).
Almost surely, 2133002333103 is an apocalyptic number.
133002333103 is a deficient number, since it is larger than the sum of its proper divisors (880810305).
133002333103 is an equidigital number, since it uses as much as digits as its factorization.
133002333103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 880810304.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 133002333103 its reverse (301333200331), we get a palindrome (434335533434).
The spelling of 133002333103 in words is "one hundred thirty-three billion, two million, three hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •