Base | Representation |
---|---|
bin | 1000000000011011… |
… | …1110010101100001 |
3 | 12112210022100120021 |
4 | 2000012332111201 |
5 | 13400210434331 |
6 | 553135113441 |
7 | 104155564165 |
oct | 20006762541 |
9 | 5483270507 |
10 | 2149311841 |
11 | a03259886 |
12 | 4bb972881 |
13 | 283394c71 |
14 | 165644ca5 |
15 | c8a58211 |
hex | 801be561 |
2149311841 has 4 divisors (see below), whose sum is σ = 2176518400. Its totient is φ = 2122105284.
The previous prime is 2149311839. The next prime is 2149311859. The reversal of 2149311841 is 1481139412.
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 2149311841 - 21 = 2149311839 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2149311797 and 2149311806.
It is not an unprimeable number, because it can be changed into a prime (2149311811) 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, 13603161 + ... + 13603318.
It is an arithmetic number, because the mean of its divisors is an integer number (544129600).
Almost surely, 22149311841 is an apocalyptic number.
It is an amenable number.
2149311841 is a deficient number, since it is larger than the sum of its proper divisors (27206559).
2149311841 is an equidigital number, since it uses as much as digits as its factorization.
2149311841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27206558.
The product of its digits is 6912, while the sum is 34.
The square root of 2149311841 is about 46360.6712742600. The cubic root of 2149311841 is about 1290.5251634561.
The spelling of 2149311841 in words is "two billion, one hundred forty-nine million, three hundred eleven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •