Search a number
-
+
11010032302 = 25505016151
BaseRepresentation
bin10100100000011111…
…11100001010101110
31001102022022120222011
422100033330022232
5140022032013202
65020303111434
7536560505353
oct122017741256
931368276864
1011010032302
11473a970255
1221732a257a
13106602ab19
1476636262a
154468c1bd7
hex2903fc2ae

11010032302 has 4 divisors (see below), whose sum is σ = 16515048456. Its totient is φ = 5505016150.

The previous prime is 11010032291. The next prime is 11010032387. The reversal of 11010032302 is 20323001011.

11010032302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2752508074 + ... + 2752508077.

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

Almost surely, 211010032302 is an apocalyptic number.

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

11010032302 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5505016153.

The product of its (nonzero) digits is 36, while the sum is 13.

Adding to 11010032302 its reverse (20323001011), we get a palindrome (31333033313).

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

Divisors: 1 2 5505016151 11010032302