Search a number
-
+
11013311010 = 2351328239259
BaseRepresentation
bin10100100000111000…
…11100101000100010
31001102112111011111210
422100130130220202
5140023401423020
65020501250550
7536630412312
oct122034345042
931375434453
1011013311010
1147417aa629
122174403a56
1310669082a0
14766977442
15446d1d3e0
hex29071ca22

11013311010 has 32 divisors (see below), whose sum is σ = 28465174080. Its totient is φ = 2710968768.

The previous prime is 11013311009. The next prime is 11013311077. The reversal of 11013311010 is 1011331011.

It is a Curzon number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14119240 + ... + 14120019.

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

Almost surely, 211013311010 is an apocalyptic number.

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

11013311010 is an abundant number, since it is smaller than the sum of its proper divisors (17451863070).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 28239282.

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

Adding to 11013311010 its reverse (1011331011), we get a palindrome (12024642021).

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

Divisors: 1 2 3 5 6 10 13 15 26 30 39 65 78 130 195 390 28239259 56478518 84717777 141196295 169435554 282392590 367110367 423588885 734220734 847177770 1101331101 1835551835 2202662202 3671103670 5506655505 11013311010