Search a number
-
+
20021101101001 = 7111320001100001
BaseRepresentation
bin1001000110101100001101…
…00111100111111111001001
32121212222221221220111112001
410203112012213213333021
510111011203340213001
6110325322235551001
74134322356305530
oct443260647477711
977788857814461
1020021101101001
1164199a0693590
1222b42822bb461
13b22c9bb36510
144d305288b317
1524abdc604001
hex1235869e7fc9

20021101101001 has 16 divisors (see below), whose sum is σ = 26881478402688. Its totient is φ = 14400792000000.

The previous prime is 20021101100963. The next prime is 20021101101017. The reversal of 20021101101001 is 10010110112002.

It is not a de Polignac number, because 20021101101001 - 27 = 20021101100873 is a prime.

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

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

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

Almost surely, 220021101101001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 20001100032.

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

Adding to 20021101101001 its reverse (10010110112002), we get a palindrome (30031211213003).

It can be divided in two parts, 20021101 and 101001, that added together give a palindrome (20122102).

The spelling of 20021101101001 in words is "twenty trillion, twenty-one billion, one hundred one million, one hundred one thousand, one".

Divisors: 1 7 11 13 77 91 143 1001 20001100001 140007700007 220012100011 260014300013 1540084700077 1820100100091 2860157300143 20021101101001