Base | Representation |
---|---|
bin | 11111000001000101… |
… | …011100011110101011 |
3 | 10011222000201201012210 |
4 | 133001011130132223 |
5 | 1021201333414011 |
6 | 23144424340203 |
7 | 2256211016205 |
oct | 370105343653 |
9 | 104860651183 |
10 | 33304201131 |
11 | 13140398273 |
12 | 6555614663 |
13 | 31a9ab86b6 |
14 | 187d1d9775 |
15 | cedc5b6a6 |
hex | 7c115c7ab |
33304201131 has 8 divisors (see below), whose sum is σ = 44413986960. Its totient is φ = 22198608032.
The previous prime is 33304201127. The next prime is 33304201153. The reversal of 33304201131 is 13110240333.
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 33304201131 - 22 = 33304201127 is a prime.
It is a super-2 number, since 2×333042011312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33304201098 and 33304201107.
It is not an unprimeable number, because it can be changed into a prime (33304203131) 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, 1029600 + ... + 1061453.
It is an arithmetic number, because the mean of its divisors is an integer number (5551748370).
Almost surely, 233304201131 is an apocalyptic number.
33304201131 is a deficient number, since it is larger than the sum of its proper divisors (11109785829).
33304201131 is a wasteful number, since it uses less digits than its factorization.
33304201131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2096365.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 33304201131 its reverse (13110240333), we get a palindrome (46414441464).
The spelling of 33304201131 in words is "thirty-three billion, three hundred four million, two hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •