Base | Representation |
---|---|
bin | 1011101101001010011… |
… | …1011010100100100111 |
3 | 201020002010222021212210 |
4 | 2323102213122210213 |
5 | 11243324110342211 |
6 | 232215054414503 |
7 | 20346332110422 |
oct | 2732247324447 |
9 | 636063867783 |
10 | 201102043431 |
11 | 783179517a3 |
12 | 32b84801433 |
13 | 15c6b736c93 |
14 | 9a3a5d29b9 |
15 | 53700b09a6 |
hex | 2ed29da927 |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •