Search a number
-
+
201102043431 = 3372716685351
BaseRepresentation
bin1011101101001010011…
…1011010100100100111
3201020002010222021212210
42323102213122210213
511243324110342211
6232215054414503
720346332110422
oct2732247324447
9636063867783
10201102043431
11783179517a3
1232b84801433
1315c6b736c93
149a3a5d29b9
1553700b09a6
hex2ed29da927

201102043431 has 16 divisors (see below), whose sum is σ = 276399193088. Its totient is φ = 129963204000.

The previous prime is 201102043427. The next prime is 201102043447. The reversal of 201102043431 is 134340201102.

It is not a de Polignac number, because 201102043431 - 22 = 201102043427 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

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

Almost surely, 2201102043431 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6685662.

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

Adding to 201102043431 its reverse (134340201102), we get a palindrome (335442244533).

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

Divisors: 1 3 37 111 271 813 10027 30081 6685351 20056053 247357987 742073961 1811730121 5435190363 67034014477 201102043431