Base | Representation |
---|---|
bin | 1000000011111101… |
… | …1111100100101001 |
3 | 12120211012002120102 |
4 | 2000333133210221 |
5 | 13413004044131 |
6 | 554424435145 |
7 | 104425533125 |
oct | 20077374451 |
9 | 5524162512 |
10 | 2164128041 |
11 | a10659479 |
12 | 504918ab5 |
13 | 286481a4a |
14 | 1675c0585 |
15 | c9ed31cb |
hex | 80fdf929 |
2164128041 has 4 divisors (see below), whose sum is σ = 2174384784. Its totient is φ = 2153871300.
The previous prime is 2164128023. The next prime is 2164128047. The reversal of 2164128041 is 1408214612.
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 a de Polignac number, because none of the positive numbers 2k-2164128041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2164127995 and 2164128013.
It is not an unprimeable number, because it can be changed into a prime (2164128047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5128055 + ... + 5128476.
It is an arithmetic number, because the mean of its divisors is an integer number (543596196).
Almost surely, 22164128041 is an apocalyptic number.
It is an amenable number.
2164128041 is a deficient number, since it is larger than the sum of its proper divisors (10256743).
2164128041 is a wasteful number, since it uses less digits than its factorization.
2164128041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10256742.
The product of its (nonzero) digits is 3072, while the sum is 29.
The square root of 2164128041 is about 46520.1896062344. The cubic root of 2164128041 is about 1293.4837709760.
The spelling of 2164128041 in words is "two billion, one hundred sixty-four million, one hundred twenty-eight thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •