Base | Representation |
---|---|
bin | 111101011011000011101 |
3 | 10210020220111 |
4 | 13223120131 |
5 | 1003401301 |
6 | 111050021 |
7 | 23051635 |
oct | 7533035 |
9 | 3706814 |
10 | 2012701 |
11 | 1155199 |
12 | 810911 |
13 | 556162 |
14 | 3a56c5 |
15 | 29b551 |
hex | 1eb61d |
2012701 has 4 divisors (see below), whose sum is σ = 2059552. Its totient is φ = 1965852.
The previous prime is 2012693. The next prime is 2012711. The reversal of 2012701 is 1072102.
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 an emirpimes, since its reverse is a distinct semiprime: 1072102 = 2 ⋅536051.
It is a cyclic number.
It is not a de Polignac number, because 2012701 - 23 = 2012693 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012711) 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, 23361 + ... + 23446.
It is an arithmetic number, because the mean of its divisors is an integer number (514888).
22012701 is an apocalyptic number.
It is an amenable number.
2012701 is a deficient number, since it is larger than the sum of its proper divisors (46851).
2012701 is an equidigital number, since it uses as much as digits as its factorization.
2012701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46850.
The product of its (nonzero) digits is 28, while the sum is 13.
The square root of 2012701 is about 1418.6969373337. The cubic root of 2012701 is about 126.2582466920.
Adding to 2012701 its reverse (1072102), we get a palindrome (3084803).
It can be divided in two parts, 20 and 12701, that added together give a palindrome (12721).
The spelling of 2012701 in words is "two million, twelve thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •