Search a number
-
+
330110201013 = 3110036733671
BaseRepresentation
bin1001100110111000001…
…10011110110010110101
31011120001221120201111020
410303130012132302311
520402031202413023
6411352303131353
732564303261055
oct4633406366265
91146057521436
10330110201013
11117aa9669a4a
1253b892a3b59
132518ac996b8
1411d98075565
1588c0d04de3
hex4cdc19ecb5

330110201013 has 4 divisors (see below), whose sum is σ = 440146934688. Its totient is φ = 220073467340.

The previous prime is 330110200949. The next prime is 330110201041. The reversal of 330110201013 is 310102011033.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 330110201013 - 26 = 330110200949 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 330110200983 and 330110201001.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (330110201063) 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, 55018366833 + ... + 55018366838.

It is an arithmetic number, because the mean of its divisors is an integer number (110036733672).

Almost surely, 2330110201013 is an apocalyptic number.

It is an amenable number.

330110201013 is a deficient number, since it is larger than the sum of its proper divisors (110036733675).

330110201013 is a wasteful number, since it uses less digits than its factorization.

330110201013 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 110036733674.

The product of its (nonzero) digits is 54, while the sum is 15.

Adding to 330110201013 its reverse (310102011033), we get a palindrome (640212212046).

The spelling of 330110201013 in words is "three hundred thirty billion, one hundred ten million, two hundred one thousand, thirteen".

Divisors: 1 3 110036733671 330110201013