Base | Representation |
---|---|
bin | 1010000000011010010001 |
3 | 11221021020122 |
4 | 22000122101 |
5 | 1132414441 |
6 | 132120025 |
7 | 31203404 |
oct | 12003221 |
9 | 4837218 |
10 | 2623121 |
11 | 1531876 |
12 | a66015 |
13 | 70ac57 |
14 | 4c3d3b |
15 | 36c34b |
hex | 280691 |
2623121 has 4 divisors (see below), whose sum is σ = 2761200. Its totient is φ = 2485044.
The previous prime is 2623111. The next prime is 2623123. The reversal of 2623121 is 1213262.
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-2623121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2623121.
It is not an unprimeable number, because it can be changed into a prime (2623123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69011 + ... + 69048.
It is an arithmetic number, because the mean of its divisors is an integer number (690300).
22623121 is an apocalyptic number.
It is an amenable number.
2623121 is a deficient number, since it is larger than the sum of its proper divisors (138079).
2623121 is a wasteful number, since it uses less digits than its factorization.
2623121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138078.
The product of its digits is 144, while the sum is 17.
The square root of 2623121 is about 1619.6051988062. The cubic root of 2623121 is about 137.9132865591.
Adding to 2623121 its reverse (1213262), we get a palindrome (3836383).
It can be divided in two parts, 2623 and 121, that added together give a cube (2744 = 143).
The spelling of 2623121 in words is "two million, six hundred twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •