Search a number
-
+
11012210001 = 3213432188871
BaseRepresentation
bin10100100000110000…
…01111110101010001
31001102110102020012200
422100120033311101
5140023111210001
65020421513413
7536615145342
oct122030176521
931373366180
1011012210001
114741118401
122173b72869
1310666110c0
1476676c0c9
15446ba2086
hex29060fd51

11012210001 has 24 divisors (see below), whose sum is σ = 17528486976. Its totient is φ = 6619142880.

The previous prime is 11012209987. The next prime is 11012210021. The reversal of 11012210001 is 10001221011.

It is a happy number.

It is not a de Polignac number, because 11012210001 - 29 = 11012209489 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1089405 + ... + 1099466.

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

Almost surely, 211012210001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11012210001 its reverse (10001221011), we get a palindrome (21013431012).

The spelling of 11012210001 in words is "eleven billion, twelve million, two hundred ten thousand, one".

Divisors: 1 3 9 13 39 43 117 129 387 559 1677 5031 2188871 6566613 19699839 28455323 85365969 94121453 256097907 282364359 847093077 1223578889 3670736667 11012210001