Base | Representation |
---|---|
bin | 1000000101110100110101 |
3 | 10222202111001 |
4 | 20011310311 |
5 | 1020333023 |
6 | 113243301 |
7 | 24012466 |
oct | 10056465 |
9 | 3882431 |
10 | 2121013 |
11 | 1219604 |
12 | 863531 |
13 | 59354b |
14 | 3d2d6d |
15 | 2bd6ad |
hex | 205d35 |
2121013 has 4 divisors (see below), whose sum is σ = 2123968. Its totient is φ = 2118060.
The previous prime is 2121011. The next prime is 2121017. The reversal of 2121013 is 3101212.
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 2121013 - 21 = 2121011 is a prime.
It is a super-2 number, since 2×21210132 = 8997392292338, which contains 22 as substring.
It is a Duffinian number.
2121013 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 370 + ... + 2092.
It is an arithmetic number, because the mean of its divisors is an integer number (530992).
22121013 is an apocalyptic number.
It is an amenable number.
2121013 is a deficient number, since it is larger than the sum of its proper divisors (2955).
2121013 is a wasteful number, since it uses less digits than its factorization.
2121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2954.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 2121013 is about 1456.3698019391. The cubic root of 2121013 is about 128.4836237060.
Adding to 2121013 its reverse (3101212), we get a palindrome (5222225).
It can be divided in two parts, 212 and 1013, that added together give a triangular number (1225 = T49).
The spelling of 2121013 in words is "two million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •