Search a number
-
+
11030311013 = 229203923623
BaseRepresentation
bin10100100010111010…
…10011000001100101
31001110201110212010112
422101131103001211
5140042224423023
65022305502405
7540225045101
oct122135230145
931421425115
1011030311013
114750360a17
12217a041a05
13106a2ab067
14768d20901
1544857a478
hex291753065

11030311013 has 8 divisors (see below), whose sum is σ = 11084380800. Its totient is φ = 10976293008.

The previous prime is 11030311009. The next prime is 11030311049. The reversal of 11030311013 is 31011303011.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11030311013 - 22 = 11030311009 is a prime.

It is a super-2 number, since 2×110303110132 (a number of 21 digits) 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 (11030301013) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 455120 + ... + 478742.

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

Almost surely, 211030311013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 25891.

The product of its (nonzero) digits is 27, while the sum is 14.

Adding to 11030311013 its reverse (31011303011), we get a palindrome (42041614024).

The spelling of 11030311013 in words is "eleven billion, thirty million, three hundred eleven thousand, thirteen".

Divisors: 1 229 2039 23623 466931 5409667 48167297 11030311013