Base | Representation |
---|---|
bin | 111101111100010101… |
… | …0111000110110000011 |
3 | 110201100110111112002101 |
4 | 1323320222320312003 |
5 | 4134411334330311 |
6 | 141035313531231 |
7 | 12416245640365 |
oct | 1737052706603 |
9 | 421313445071 |
10 | 133021011331 |
11 | 5146099070a |
12 | 21944573b17 |
13 | c70ba348c0 |
14 | 661c7c0d35 |
15 | 36d81a7ec1 |
hex | 1ef8ab8d83 |
133021011331 has 8 divisors (see below), whose sum is σ = 143263749104. Its totient is φ = 122779752480.
The previous prime is 133021011317. The next prime is 133021011371. The reversal of 133021011331 is 133110120331.
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 133021011331 - 223 = 133012622723 is a prime.
It is a super-3 number, since 3×1330210113313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133021011299 and 133021011308.
It is not an unprimeable number, because it can be changed into a prime (133021011371) 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, 179280 + ... + 546061.
It is an arithmetic number, because the mean of its divisors is an integer number (17907968638).
Almost surely, 2133021011331 is an apocalyptic number.
133021011331 is a deficient number, since it is larger than the sum of its proper divisors (10242737773).
133021011331 is a wasteful number, since it uses less digits than its factorization.
133021011331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739461.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 133021011331 its reverse (133110120331), we get a palindrome (266131131662).
The spelling of 133021011331 in words is "one hundred thirty-three billion, twenty-one million, eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •