Base | Representation |
---|---|
bin | 1000000011000111… |
… | …0010010100111001 |
3 | 12120120102112121221 |
4 | 2000301302110321 |
5 | 13411044103331 |
6 | 554215432041 |
7 | 104353146253 |
oct | 20061622471 |
9 | 5516375557 |
10 | 2160534841 |
11 | a09624893 |
12 | 503685621 |
13 | 2857c43aa |
14 | 166d26cd3 |
15 | c9a23711 |
hex | 80c72539 |
2160534841 has 4 divisors (see below), whose sum is σ = 2171392000. Its totient is φ = 2149677684.
The previous prime is 2160534839. The next prime is 2160534847. The reversal of 2160534841 is 1484350612.
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 2160534841 - 21 = 2160534839 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2160534797 and 2160534806.
It is not an unprimeable number, because it can be changed into a prime (2160534847) 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, 5428281 + ... + 5428678.
It is an arithmetic number, because the mean of its divisors is an integer number (542848000).
Almost surely, 22160534841 is an apocalyptic number.
It is an amenable number.
2160534841 is a deficient number, since it is larger than the sum of its proper divisors (10857159).
2160534841 is a wasteful number, since it uses less digits than its factorization.
2160534841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10857158.
The product of its (nonzero) digits is 23040, while the sum is 34.
The square root of 2160534841 is about 46481.5537713618. The cubic root of 2160534841 is about 1292.7674978072.
The spelling of 2160534841 in words is "two billion, one hundred sixty million, five hundred thirty-four thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •