Base | Representation |
---|---|
bin | 111111101110110… |
… | …101101010011101 |
3 | 2202111222011200222 |
4 | 333232311222131 |
5 | 4142211234122 |
6 | 254033331125 |
7 | 35332262432 |
oct | 7756655235 |
9 | 2674864628 |
10 | 1069243037 |
11 | 4a9618135 |
12 | 25a106aa5 |
13 | 1406a22b5 |
14 | a2013b89 |
15 | 63d0cb42 |
hex | 3fbb5a9d |
1069243037 has 2 divisors, whose sum is σ = 1069243038. Its totient is φ = 1069243036.
The previous prime is 1069243003. The next prime is 1069243039. The reversal of 1069243037 is 7303429601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1035938596 + 33304441 = 32186^2 + 5771^2 .
It is a cyclic number.
It is not a de Polignac number, because 1069243037 - 26 = 1069242973 is a prime.
It is a super-2 number, since 2×10692430372 = 2286561344345966738, which contains 22 as substring.
Together with 1069243039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1069242988 and 1069243006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1069243039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534621518 + 534621519.
It is an arithmetic number, because the mean of its divisors is an integer number (534621519).
Almost surely, 21069243037 is an apocalyptic number.
It is an amenable number.
1069243037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1069243037 is an equidigital number, since it uses as much as digits as its factorization.
1069243037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 1069243037 is about 32699.2819034302. The cubic root of 1069243037 is about 1022.5678721413.
The spelling of 1069243037 in words is "one billion, sixty-nine million, two hundred forty-three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •