Search a number
-
+
300002201110 = 2530000220111
BaseRepresentation
bin1000101110110011000…
…01100100111000010110
31001200100200001212002201
410113121201210320112
514403401030413420
6345452532155114
730450222430513
oct4273141447026
91050320055081
10300002201110
1110625946aaa7
124a186168a9a
13223a041c741
141073d55630a
157c0c99610a
hex45d9864e16

300002201110 has 8 divisors (see below), whose sum is σ = 540003962016. Its totient is φ = 120000880440.

The previous prime is 300002201101. The next prime is 300002201111. The reversal of 300002201110 is 11102200003.

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

It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 30000220111 = 300002201110 / (3 + 0 + 0 + 0 + 0 + 2 + 2 + 0 + 1 + 1 + 1 + 0).

It is a congruent number.

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

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

Almost surely, 2300002201110 is an apocalyptic number.

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

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

300002201110 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 30000220118.

The product of its (nonzero) digits is 12, while the sum is 10.

Adding to 300002201110 its reverse (11102200003), we get a palindrome (311104401113).

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

Divisors: 1 2 5 10 30000220111 60000440222 150001100555 300002201110