Base | Representation |
---|---|
bin | 111100110011111… |
… | …010110111010001 |
3 | 2122002202201211221 |
4 | 330303322313101 |
5 | 4042140242114 |
6 | 245123205041 |
7 | 34165632403 |
oct | 7463726721 |
9 | 2562681757 |
10 | 1020243409 |
11 | 48399aa79 |
12 | 245816781 |
13 | 1334a7333 |
14 | 996dab73 |
15 | 5e87e524 |
hex | 3ccfadd1 |
1020243409 has 2 divisors, whose sum is σ = 1020243410. Its totient is φ = 1020243408.
The previous prime is 1020243397. The next prime is 1020243421. The reversal of 1020243409 is 9043420201.
It is a balanced prime because it is at equal distance from previous prime (1020243397) and next prime (1020243421).
It can be written as a sum of positive squares in only one way, i.e., 1006158400 + 14085009 = 31720^2 + 3753^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020243409 - 25 = 1020243377 is a prime.
It is a super-2 number, since 2×10202434092 = 2081793227215882562, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1020243479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510121704 + 510121705.
It is an arithmetic number, because the mean of its divisors is an integer number (510121705).
Almost surely, 21020243409 is an apocalyptic number.
It is an amenable number.
1020243409 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020243409 is an equidigital number, since it uses as much as digits as its factorization.
1020243409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 1020243409 is about 31941.2493337377. The cubic root of 1020243409 is about 1006.7027754227.
The spelling of 1020243409 in words is "one billion, twenty million, two hundred forty-three thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •