Base | Representation |
---|---|
bin | 101000000000010… |
… | …1000001110000101 |
3 | 10110112212001002011 |
4 | 1100000220032011 |
5 | 10222114421041 |
6 | 341111014221 |
7 | 45156501406 |
oct | 12000501605 |
9 | 3415761064 |
10 | 1342342021 |
11 | 629798479 |
12 | 31566a371 |
13 | 185141827 |
14 | ca3c39ad |
15 | 7cca5e81 |
hex | 50028385 |
1342342021 has 2 divisors, whose sum is σ = 1342342022. Its totient is φ = 1342342020.
The previous prime is 1342342013. The next prime is 1342342037. The reversal of 1342342021 is 1202432431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 982822500 + 359519521 = 31350^2 + 18961^2 .
It is an emirp because it is prime and its reverse (1202432431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1342342021 - 23 = 1342342013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1342341983 and 1342342001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1342342061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 671171010 + 671171011.
It is an arithmetic number, because the mean of its divisors is an integer number (671171011).
Almost surely, 21342342021 is an apocalyptic number.
It is an amenable number.
1342342021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1342342021 is an equidigital number, since it uses as much as digits as its factorization.
1342342021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 1342342021 is about 36637.9860390824. The cubic root of 1342342021 is about 1103.1156903354.
Adding to 1342342021 its reverse (1202432431), we get a palindrome (2544774452).
The spelling of 1342342021 in words is "one billion, three hundred forty-two million, three hundred forty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •