Base | Representation |
---|---|
bin | 1000000111100111010101 |
3 | 11000010112110 |
4 | 20013213111 |
5 | 1021101331 |
6 | 113341233 |
7 | 24043035 |
oct | 10074725 |
9 | 4003473 |
10 | 2128341 |
11 | 1224066 |
12 | 867819 |
13 | 596997 |
14 | 3d58c5 |
15 | 2c0946 |
hex | 2079d5 |
2128341 has 4 divisors (see below), whose sum is σ = 2837792. Its totient is φ = 1418892.
The previous prime is 2128333. The next prime is 2128381. The reversal of 2128341 is 1438212.
2128341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 2128341 - 23 = 2128333 is a prime.
It is a d-powerful number, because it can be written as 213 + 1 + 219 + 83 + 313 + 45 + 1 .
It is a D-number.
It is a Duffinian number.
2128341 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2128381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 354721 + ... + 354726.
It is an arithmetic number, because the mean of its divisors is an integer number (709448).
22128341 is an apocalyptic number.
It is an amenable number.
2128341 is a deficient number, since it is larger than the sum of its proper divisors (709451).
2128341 is an equidigital number, since it uses as much as digits as its factorization.
2128341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709450.
The product of its digits is 384, while the sum is 21.
The square root of 2128341 is about 1458.8834771838. The cubic root of 2128341 is about 128.6314219137.
The spelling of 2128341 in words is "two million, one hundred twenty-eight thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •