Base | Representation |
---|---|
bin | 111110101101010… |
… | …0101011100110101 |
3 | 12102122021102120122 |
4 | 1331122211130311 |
5 | 13302123334031 |
6 | 544442341325 |
7 | 103066506653 |
oct | 17532453465 |
9 | 5378242518 |
10 | 2104121141 |
11 | 98a7a33a1 |
12 | 4a87ba845 |
13 | 276c018c5 |
14 | 15d63ddd3 |
15 | c4acd47b |
hex | 7d6a5735 |
2104121141 has 4 divisors (see below), whose sum is σ = 2120689152. Its totient is φ = 2087553132.
The previous prime is 2104121119. The next prime is 2104121207. The reversal of 2104121141 is 1411214012.
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 2104121141 - 226 = 2037012277 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 (2104121101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8283815 + ... + 8284068.
It is an arithmetic number, because the mean of its divisors is an integer number (530172288).
Almost surely, 22104121141 is an apocalyptic number.
It is an amenable number.
2104121141 is a deficient number, since it is larger than the sum of its proper divisors (16568011).
2104121141 is a wasteful number, since it uses less digits than its factorization.
2104121141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16568010.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 2104121141 is about 45870.7002453636. The cubic root of 2104121141 is about 1281.4163076574.
Adding to 2104121141 its reverse (1411214012), we get a palindrome (3515335153).
The spelling of 2104121141 in words is "two billion, one hundred four million, one hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •