Base | Representation |
---|---|
bin | 111111101110010… |
… | …101011010011101 |
3 | 2202111201110111112 |
4 | 333232111122131 |
5 | 4142143022231 |
6 | 254030431405 |
7 | 35331202343 |
oct | 7756253235 |
9 | 2674643445 |
10 | 1069110941 |
11 | 4a9537968 |
12 | 25a062565 |
13 | 140657132 |
14 | a1dbb993 |
15 | 63cd392b |
hex | 3fb9569d |
1069110941 has 2 divisors, whose sum is σ = 1069110942. Its totient is φ = 1069110940.
The previous prime is 1069110929. The next prime is 1069110997. The reversal of 1069110941 is 1490119601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 775845316 + 293265625 = 27854^2 + 17125^2 .
It is an emirp because it is prime and its reverse (1490119601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1069110941 is a prime.
It is a super-2 number, since 2×10691109412 = 2285996408331810962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1069110898 and 1069110907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1069110901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 534555470 + 534555471.
It is an arithmetic number, because the mean of its divisors is an integer number (534555471).
Almost surely, 21069110941 is an apocalyptic number.
It is an amenable number.
1069110941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1069110941 is an equidigital number, since it uses as much as digits as its factorization.
1069110941 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 32.
The square root of 1069110941 is about 32697.2619801720. The cubic root of 1069110941 is about 1022.5257605153.
The spelling of 1069110941 in words is "one billion, sixty-nine million, one hundred ten thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •