Base | Representation |
---|---|
bin | 1000001011111011011101 |
3 | 11001000202222 |
4 | 20023323131 |
5 | 1022133023 |
6 | 113555125 |
7 | 24145412 |
oct | 10137335 |
9 | 4030688 |
10 | 2146013 |
11 | 1236371 |
12 | 875aa5 |
13 | 5a1a3c |
14 | 3dc109 |
15 | 2c5cc8 |
hex | 20bedd |
2146013 has 4 divisors (see below), whose sum is σ = 2148960. Its totient is φ = 2143068.
The previous prime is 2146009. The next prime is 2146043. The reversal of 2146013 is 3106412.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2146013 - 22 = 2146009 is a prime.
It is a d-powerful number, because it can be written as 221 + 1 + 42 + 66 + 0 + 1 + 37 .
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2145982 and 2146000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2146003) 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, 506 + ... + 2132.
It is an arithmetic number, because the mean of its divisors is an integer number (537240).
22146013 is an apocalyptic number.
It is an amenable number.
2146013 is a deficient number, since it is larger than the sum of its proper divisors (2947).
2146013 is a wasteful number, since it uses less digits than its factorization.
2146013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2946.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2146013 is about 1464.9276432643. The cubic root of 2146013 is about 128.9864577255.
The spelling of 2146013 in words is "two million, one hundred forty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •