Base | Representation |
---|---|
bin | 111111110000101… |
… | …111110011010001 |
3 | 2202112220120221201 |
4 | 333300233303101 |
5 | 4142323241223 |
6 | 254052151201 |
7 | 35336445112 |
oct | 7760576321 |
9 | 2675816851 |
10 | 1069743313 |
11 | 4a9929a91 |
12 | 25a308501 |
13 | 140818c12 |
14 | a2104209 |
15 | 63daaead |
hex | 3fc2fcd1 |
1069743313 has 2 divisors, whose sum is σ = 1069743314. Its totient is φ = 1069743312.
The previous prime is 1069743281. The next prime is 1069743349. The reversal of 1069743313 is 3133479601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 999065664 + 70677649 = 31608^2 + 8407^2 .
It is a cyclic number.
It is not a de Polignac number, because 1069743313 - 25 = 1069743281 is a prime.
It is a super-2 number, since 2×10697433132 = 2288701511416431938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1069747313) 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, 534871656 + 534871657.
It is an arithmetic number, because the mean of its divisors is an integer number (534871657).
Almost surely, 21069743313 is an apocalyptic number.
It is an amenable number.
1069743313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1069743313 is an equidigital number, since it uses as much as digits as its factorization.
1069743313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 37.
The square root of 1069743313 is about 32706.9306569724. The cubic root of 1069743313 is about 1022.7273265043.
The spelling of 1069743313 in words is "one billion, sixty-nine million, seven hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •