Base | Representation |
---|---|
bin | 111101111100010011… |
… | …1001001010010110101 |
3 | 110201100101122200010201 |
4 | 1323320213021102311 |
5 | 4134411111431013 |
6 | 141035240520501 |
7 | 12416234412634 |
oct | 1737047112265 |
9 | 421311580121 |
10 | 133020030133 |
11 | 51460380501 |
12 | 21944180131 |
13 | c70b780103 |
14 | 661c60751b |
15 | 36d80623dd |
hex | 1ef89c94b5 |
133020030133 has 4 divisors (see below), whose sum is σ = 138803509728. Its totient is φ = 127236550540.
The previous prime is 133020030107. The next prime is 133020030151. The reversal of 133020030133 is 331030020331.
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 a de Polignac number, because none of the positive numbers 2k-133020030133 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133020030133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133020030163) 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, 2891739763 + ... + 2891739808.
It is an arithmetic number, because the mean of its divisors is an integer number (34700877432).
Almost surely, 2133020030133 is an apocalyptic number.
It is an amenable number.
133020030133 is a deficient number, since it is larger than the sum of its proper divisors (5783479595).
133020030133 is an equidigital number, since it uses as much as digits as its factorization.
133020030133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5783479594.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 133020030133 its reverse (331030020331), we get a palindrome (464050050464).
The spelling of 133020030133 in words is "one hundred thirty-three billion, twenty million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •