Search a number
201043330131 = 371713722318433
BaseRepresentation
bin1011101100111100011…
…1011100010001010011
3201012221001111100101010
42323033013130101103
511243214043031011
6232205200142003
720345020052550
oct2731707342123
9635831440333
10201043330131
117829779a606
1232b69007903
1315c5c51a897
149a328aba27
155369d641a6
hex2ecf1dc453

201043330131 has 64 divisors (see below), whose sum is σ = 328223121408. Its totient is φ = 106847797248.

The previous prime is 201043330109. The next prime is 201043330139. The reversal of 201043330131 is 131033340102.

Adding to 201043330131 its reverse (131033340102), we get a palindrome (332076670233).

It is not a de Polignac number, because 201043330131 - 213 = 201043321939 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (21).

It is a junction number, because it is equal to n+sod(n) for n = 201043330098 and 201043330107.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10897491 + ... + 10915923.

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

Almost surely, 2201043330131 is an apocalyptic number.

201043330131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.

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

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

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

The sum of its prime factors is 18820.

The product of its (nonzero) digits is 648, while the sum is 21.

The spelling of 201043330131 in words is "two hundred one billion, forty-three million, three hundred thirty thousand, one hundred thirty-one".