Search a number
-
+
11000211213 = 331607194863
BaseRepresentation
bin10100011111010100…
…11110011100001101
31001101121211121222010
422033222132130031
5140012023224323
65015312411433
7536411152425
oct121752363415
931347747863
1011000211213
114735372552
12216bb46b79
131063c9c824
14764d27485
15445ad1c93
hex28fa9e70d

11000211213 has 16 divisors (see below), whose sum is σ = 15165095936. Its totient is φ = 7085182320.

The previous prime is 11000211197. The next prime is 11000211319. The reversal of 11000211213 is 31211200011.

It is not a de Polignac number, because 11000211213 - 24 = 11000211197 is a prime.

It is a super-2 number, since 2×110002112132 (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 (11000211713) by changing a digit.

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

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

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

Almost surely, 211000211213 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 195504.

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

Adding to 11000211213 its reverse (31211200011), we get a palindrome (42211411224).

The spelling of 11000211213 in words is "eleven billion, two hundred eleven thousand, two hundred thirteen".

Divisors: 1 3 31 93 607 1821 18817 56451 194863 584589 6040753 18122259 118281841 354845523 3666737071 11000211213