Search a number
-
+
11010200330 = 251101020033
BaseRepresentation
bin10100100000100001…
…00101001100001010
31001102022122010110102
422100100211030022
5140022102402310
65020310445402
7536562105263
oct122020451412
931368563412
1011010200330
11473aa75518
122173363862
13106608944c
147663a796a
154469068a5
hex29042530a

11010200330 has 8 divisors (see below), whose sum is σ = 19818360612. Its totient is φ = 4404080128.

The previous prime is 11010200329. The next prime is 11010200363. The reversal of 11010200330 is 3300201011.

It can be written as a sum of positive squares in 2 ways, for example, as 10690112449 + 320087881 = 103393^2 + 17891^2 .

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

It is a super-2 number, since 2×110102003302 (a number of 21 digits) contains 22 as substring.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550510007 + ... + 550510026.

Almost surely, 211010200330 is an apocalyptic number.

11010200330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1101020040.

The product of its (nonzero) digits is 18, while the sum is 11.

Adding to 11010200330 its reverse (3300201011), we get a palindrome (14310401341).

The spelling of 11010200330 in words is "eleven billion, ten million, two hundred thousand, three hundred thirty".

Divisors: 1 2 5 10 1101020033 2202040066 5505100165 11010200330