Base | Representation |
---|---|
bin | 111110000101010010… |
… | …0100001010111110011 |
3 | 110202010101121101212221 |
4 | 1330022210201113303 |
5 | 4141020230112321 |
6 | 141125202501511 |
7 | 12426553424434 |
oct | 1741244412763 |
9 | 422111541787 |
10 | 133321332211 |
11 | 515a5464191 |
12 | 21a09064897 |
13 | c759015772 |
14 | 664a63948b |
15 | 370472be41 |
hex | 1f0a9215f3 |
133321332211 has 8 divisors (see below), whose sum is σ = 133851942000. Its totient is φ = 132791493120.
The previous prime is 133321332191. The next prime is 133321332239. The reversal of 133321332211 is 112233123331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133321332211 is a prime.
It is a super-2 number, since 2×1333213322112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133321362211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155235 + ... + 539203.
It is an arithmetic number, because the mean of its divisors is an integer number (16731492750).
Almost surely, 2133321332211 is an apocalyptic number.
133321332211 is a deficient number, since it is larger than the sum of its proper divisors (530609789).
133321332211 is a wasteful number, since it uses less digits than its factorization.
133321332211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385349.
The product of its digits is 1944, while the sum is 25.
Adding to 133321332211 its reverse (112233123331), we get a palindrome (245554455542).
The spelling of 133321332211 in words is "one hundred thirty-three billion, three hundred twenty-one million, three hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •