Base | Representation |
---|---|
bin | 1001100110111000010… |
… | …01100010110110000001 |
3 | 1011120002000002112000201 |
4 | 10303130021202312001 |
5 | 20402031404112113 |
6 | 411352332245201 |
7 | 32564313144166 |
oct | 4633411426601 |
9 | 1146060075021 |
10 | 330111004033 |
11 | 117aaa0682a8 |
12 | 53b89610801 |
13 | 2518b1bb065 |
14 | 11d9820406d |
15 | 88c0e12cdd |
hex | 4cdc262d81 |
330111004033 has 8 divisors (see below), whose sum is σ = 333410817600. Its totient is φ = 326826942000.
The previous prime is 330111004021. The next prime is 330111004039. The reversal of 330111004033 is 330400111033.
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-330111004033 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 330111004033.
It is not an unprimeable number, because it can be changed into a prime (330111004039) 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, 3895758 + ... + 3979591.
It is an arithmetic number, because the mean of its divisors is an integer number (41676352200).
Almost surely, 2330111004033 is an apocalyptic number.
It is an amenable number.
330111004033 is a deficient number, since it is larger than the sum of its proper divisors (3299813567).
330111004033 is a wasteful number, since it uses less digits than its factorization.
330111004033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7875767.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 330111004033 its reverse (330400111033), we get a palindrome (660511115066).
The spelling of 330111004033 in words is "three hundred thirty billion, one hundred eleven million, four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •