Search a number
-
+
20101020131 = 234491946453
BaseRepresentation
bin10010101110000111…
…010011100111100011
31220212212121121211002
4102232013103213203
5312131330121011
613122334342215
71311056565143
oct225607234743
956785547732
1020101020131
118585557a35
123a8b95a96b
131b845b786a
14d898a0923
157c9a72c3b
hex4ae1d39e3

20101020131 has 8 divisors (see below), whose sum is σ = 21021703200. Its totient is φ = 19184230912.

The previous prime is 20101020127. The next prime is 20101020139. The reversal of 20101020131 is 13102010102.

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 20101020131 - 22 = 20101020127 is a prime.

It is a super-2 number, since 2×201010201312 (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 (20101020139) 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 7 ways as a sum of consecutive naturals, for example, 962900 + ... + 983553.

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

Almost surely, 220101020131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1946925.

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

Adding to 20101020131 its reverse (13102010102), we get a palindrome (33203030233).

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

Divisors: 1 23 449 10327 1946453 44768419 873957397 20101020131