Base | Representation |
---|---|
bin | 1011101101001010100… |
… | …0100011011111111101 |
3 | 201020002011112110122010 |
4 | 2323102220203133331 |
5 | 11243324144422031 |
6 | 232215105041433 |
7 | 20346334463331 |
oct | 2732250433775 |
9 | 636064473563 |
10 | 201102342141 |
11 | 78318036168 |
12 | 32b84926279 |
13 | 15c6b80cc2c |
14 | 9a3a66d7c1 |
15 | 537011e246 |
hex | 2ed2a237fd |
201102342141 has 4 divisors (see below), whose sum is σ = 268136456192. Its totient is φ = 134068228092.
The previous prime is 201102342121. The next prime is 201102342149. The reversal of 201102342141 is 141243201102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 201102342141 - 211 = 201102340093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201102342149) 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 3 ways as a sum of consecutive naturals, for example, 33517057021 + ... + 33517057026.
It is an arithmetic number, because the mean of its divisors is an integer number (67034114048).
Almost surely, 2201102342141 is an apocalyptic number.
It is an amenable number.
201102342141 is a deficient number, since it is larger than the sum of its proper divisors (67034114051).
201102342141 is an equidigital number, since it uses as much as digits as its factorization.
201102342141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67034114050.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 201102342141 its reverse (141243201102), we get a palindrome (342345543243).
The spelling of 201102342141 in words is "two hundred one billion, one hundred two million, three hundred forty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •