Search a number
-
+
20001201131 = 175974326839
BaseRepresentation
bin10010101000001010…
…100001101111101011
31220121220210021220002
4102220022201233223
5311430301414011
613104411053215
71305435255512
oct225012415753
956556707802
1020001201131
11853417a49a
123a6244120b
131b69a08572
14d7a519679
157c0e06c3b
hex4a82a1beb

20001201131 has 16 divisors (see below), whose sum is σ = 21566476800. Its totient is φ = 18480002688.

The previous prime is 20001201127. The next prime is 20001201169. The reversal of 20001201131 is 13110210002.

It is a cyclic number.

It is not a de Polignac number, because 20001201131 - 22 = 20001201127 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 220001201131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 27658.

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

Adding to 20001201131 its reverse (13110210002), we get a palindrome (33111411133).

The spelling of 20001201131 in words is "twenty billion, one million, two hundred one thousand, one hundred thirty-one".

Divisors: 1 17 59 743 1003 12631 26839 43837 456263 745229 1583501 19941377 26919517 339003409 1176541243 20001201131