Base | Representation |
---|---|
bin | 1000001100110010… |
… | …0010001101010101 |
3 | 12200101202112010111 |
4 | 2003030202031111 |
5 | 14001440214031 |
6 | 1002225123021 |
7 | 105355023331 |
oct | 20314421525 |
9 | 5611675114 |
10 | 2201101141 |
11 | a2a511958 |
12 | 515189471 |
13 | 291028915 |
14 | 16c4867c1 |
15 | cd3881b1 |
hex | 83322355 |
2201101141 has 4 divisors (see below), whose sum is σ = 2238408000. Its totient is φ = 2163794284.
The previous prime is 2201101139. The next prime is 2201101223. The reversal of 2201101141 is 1411011022.
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 a cyclic number.
It is not a de Polignac number, because 2201101141 - 21 = 2201101139 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 (2201101241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18653341 + ... + 18653458.
It is an arithmetic number, because the mean of its divisors is an integer number (559602000).
Almost surely, 22201101141 is an apocalyptic number.
It is an amenable number.
2201101141 is a deficient number, since it is larger than the sum of its proper divisors (37306859).
2201101141 is an equidigital number, since it uses as much as digits as its factorization.
2201101141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37306858.
The product of its (nonzero) digits is 16, while the sum is 13.
The square root of 2201101141 is about 46915.8943323049. The cubic root of 2201101141 is about 1300.8084007447.
Adding to 2201101141 its reverse (1411011022), we get a palindrome (3612112163).
The spelling of 2201101141 in words is "two billion, two hundred one million, one hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •