Base | Representation |
---|---|
bin | 10011101011110… |
… | …010111001111101 |
3 | 212000102022211012 |
4 | 103223302321331 |
5 | 1134020412210 |
6 | 52434205005 |
7 | 11120026406 |
oct | 2353627175 |
9 | 760368735 |
10 | 330247805 |
11 | 15a464078 |
12 | 92723765 |
13 | 5355b804 |
14 | 31c089ad |
15 | 1ded6305 |
hex | 13af2e7d |
330247805 has 8 divisors (see below), whose sum is σ = 409081344. Its totient is φ = 255675600.
The previous prime is 330247789. The next prime is 330247807. The reversal of 330247805 is 508742033.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 330247805 - 24 = 330247789 is a prime.
It is a super-2 number, since 2×3302478052 = 218127225414636050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330247807) 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, 1065161 + ... + 1065470.
It is an arithmetic number, because the mean of its divisors is an integer number (51135168).
Almost surely, 2330247805 is an apocalyptic number.
It is an amenable number.
330247805 is a deficient number, since it is larger than the sum of its proper divisors (78833539).
330247805 is a wasteful number, since it uses less digits than its factorization.
330247805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2130667.
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 330247805 is about 18172.7214527709. The cubic root of 330247805 is about 691.2152532001.
Adding to 330247805 its reverse (508742033), we get a palindrome (838989838).
The spelling of 330247805 in words is "three hundred thirty million, two hundred forty-seven thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •