Search a number
-
+
20031201131 = 162125034937
BaseRepresentation
bin10010101001111100…
…111101111101101011
31220201000020110011012
4102221330331331223
5312010441414011
613111402054135
71306251254204
oct225174757553
956630213135
1020031201131
11854a0aa987
123a704aa34b
131b72cb0546
14d804c85ab
157c3880a8b
hex4a9f3df6b

20031201131 has 8 divisors (see below), whose sum is σ = 20055627744. Its totient is φ = 20006792640.

The previous prime is 20031201107. The next prime is 20031201137. The reversal of 20031201131 is 13110213002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 20031201131 - 210 = 20031200107 is a prime.

It is a super-2 number, since 2×200312011312 (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 (20031201137) by changing a digit.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4054895 + ... + 4059831.

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

Almost surely, 220031201131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9061.

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

Adding to 20031201131 its reverse (13110213002), we get a palindrome (33141414133).

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

Divisors: 1 1621 2503 4937 4057363 8002877 12357311 20031201131