Base | Representation |
---|---|
bin | 101001100010001111101 |
3 | 2120010222012 |
4 | 11030101331 |
5 | 322023041 |
6 | 45101005 |
7 | 14365664 |
oct | 5142175 |
9 | 2503865 |
10 | 1361021 |
11 | 84a612 |
12 | 557765 |
13 | 38864c |
14 | 275ddb |
15 | 1bd3eb |
hex | 14c47d |
1361021 has 2 divisors, whose sum is σ = 1361022. Its totient is φ = 1361020.
The previous prime is 1361011. The next prime is 1361023. The reversal of 1361021 is 1201631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 835396 + 525625 = 914^2 + 725^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361021 - 210 = 1359997 is a prime.
It is a Sophie Germain prime.
Together with 1361023, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1360987 and 1361005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1361023) 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 as a sum of consecutive naturals, namely, 680510 + 680511.
It is an arithmetic number, because the mean of its divisors is an integer number (680511).
21361021 is an apocalyptic number.
It is an amenable number.
1361021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361021 is an equidigital number, since it uses as much as digits as its factorization.
1361021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1361021 is about 1166.6280469798. The cubic root of 1361021 is about 110.8208836463.
Adding to 1361021 its reverse (1201631), we get a palindrome (2562652).
It can be divided in two parts, 13610 and 21, that added together give a palindrome (13631).
The spelling of 1361021 in words is "one million, three hundred sixty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •