Search a number
-
+
211556511009 = 32192774466327
BaseRepresentation
bin1100010100000111000…
…0000010110100100001
3202020001201220021022200
43011001300002310201
511431231431323014
6241104314123413
721166365446634
oct3050160026441
9666051807280
10211556511009
11817a2153a48
1235001a20569
1316c4662677c
14a34cc57c1b
155782ce0a09
hex3141c02d21

211556511009 has 24 divisors (see below), whose sum is σ = 322826187840. Its totient is φ = 133132245408.

The previous prime is 211556511007. The next prime is 211556511059. The reversal of 211556511009 is 900115655112.

It is not a de Polignac number, because 211556511009 - 21 = 211556511007 is a prime.

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

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (211556511007) by changing a digit.

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 23 ways as a sum of consecutive naturals, for example, 2185797 + ... + 2280530.

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

Almost surely, 2211556511009 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4466629 (or 4466626 counting only the distinct ones).

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

The spelling of 211556511009 in words is "two hundred eleven billion, five hundred fifty-six million, five hundred eleven thousand, nine".

Divisors: 1 3 9 19 57 171 277 831 2493 5263 15789 47367 4466327 13398981 40196943 84860213 254580639 763741917 1237172579 3711517737 11134553211 23506279001 70518837003 211556511009