Search a number
-
+
20031122131 = 197101680823
BaseRepresentation
bin10010101001111100…
…101010101011010011
31220201000002102210021
4102221330222223103
5312010431402011
613111400244311
71306250504656
oct225174525323
956630072707
1020031122131
11854a056599
123a70470697
131b72c835b7
14d804a789d
157c3867471
hex4a9f2aad3

20031122131 has 4 divisors (see below), whose sum is σ = 20132803152. Its totient is φ = 19929441112.

The previous prime is 20031122129. The next prime is 20031122141. The reversal of 20031122131 is 13122113002.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 20031122131 - 21 = 20031122129 is a prime.

It is a super-2 number, since 2×200311221312 (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 (20031122101) 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 3 ways as a sum of consecutive naturals, for example, 50840215 + ... + 50840608.

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

Almost surely, 220031122131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 101681020.

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

Adding to 20031122131 its reverse (13122113002), we get a palindrome (33153235133).

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

Divisors: 1 197 101680823 20031122131