Base | Representation |
---|---|
bin | 100101100001110111100010… |
… | …1110111110000010000011001 |
3 | 1121021211020011012022212011111 |
4 | 1023003233011313300100121 |
5 | 321232011203022133033 |
6 | 3130030312030300321 |
7 | 126350450524262251 |
oct | 11303570567602031 |
9 | 1537736135285144 |
10 | 330110211130393 |
11 | 96201a55256011 |
12 | 310356a19576a1 |
13 | 1122734a9c4495 |
14 | 5b735c3044961 |
15 | 2826dce0377cd |
hex | 12c3bc5df0419 |
330110211130393 has 4 divisors (see below), whose sum is σ = 330130274977828. Its totient is φ = 330090147282960.
The previous prime is 330110211130373. The next prime is 330110211130397. The reversal of 330110211130393 is 393031112011033.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 165704783333769 + 164405427796624 = 12872637^2 + 12822068^2 .
It is a cyclic number.
It is not a de Polignac number, because 330110211130393 - 237 = 329972772176921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330110211130397) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10031899038 + ... + 10031931943.
It is an arithmetic number, because the mean of its divisors is an integer number (82532568744457).
Almost surely, 2330110211130393 is an apocalyptic number.
It is an amenable number.
330110211130393 is a deficient number, since it is larger than the sum of its proper divisors (20063847435).
330110211130393 is a wasteful number, since it uses less digits than its factorization.
330110211130393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20063847434.
The product of its (nonzero) digits is 4374, while the sum is 31.
The spelling of 330110211130393 in words is "three hundred thirty trillion, one hundred ten billion, two hundred eleven million, one hundred thirty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •