Base | Representation |
---|---|
bin | 10011101100110… |
… | …001101110101101 |
3 | 212000220101210212 |
4 | 103230301232231 |
5 | 1134102131013 |
6 | 52443512205 |
7 | 11122150550 |
oct | 2354615655 |
9 | 760811725 |
10 | 330505133 |
11 | 15a61a442 |
12 | 92828665 |
13 | 5361b98a |
14 | 31c74697 |
15 | 1e0376a8 |
hex | 13b31bad |
330505133 has 8 divisors (see below), whose sum is σ = 397600320. Its totient is φ = 268380000.
The previous prime is 330505121. The next prime is 330505139. The reversal of 330505133 is 331505033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 330505133 - 214 = 330488749 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 330505099 and 330505108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330505139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1242368 + ... + 1242633.
It is an arithmetic number, because the mean of its divisors is an integer number (49700040).
Almost surely, 2330505133 is an apocalyptic number.
It is an amenable number.
330505133 is a deficient number, since it is larger than the sum of its proper divisors (67095187).
330505133 is a wasteful number, since it uses less digits than its factorization.
330505133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2485027.
The product of its (nonzero) digits is 2025, while the sum is 23.
The square root of 330505133 is about 18179.8001364151. The cubic root of 330505133 is about 691.3947374719.
It can be divided in two parts, 33050 and 5133, that added together give a palindrome (38183).
The spelling of 330505133 in words is "three hundred thirty million, five hundred five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.515 sec. • engine limits •