Base | Representation |
---|---|
bin | 100000101000001011001 |
3 | 2000022120222 |
4 | 10011001121 |
5 | 233203040 |
6 | 34525425 |
7 | 12042020 |
oct | 4050131 |
9 | 2008528 |
10 | 1069145 |
11 | 6702a0 |
12 | 436875 |
13 | 2b583c |
14 | 1db8b7 |
15 | 161bb5 |
hex | 105059 |
1069145 has 16 divisors (see below), whose sum is σ = 1600128. Its totient is φ = 666240.
The previous prime is 1069141. The next prime is 1069171. The reversal of 1069145 is 5419601.
It is not a de Polignac number, because 1069145 - 22 = 1069141 is a prime.
It is a super-2 number, since 2×10691452 = 2286142062050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1069141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1004 + ... + 1773.
It is an arithmetic number, because the mean of its divisors is an integer number (100008).
21069145 is an apocalyptic number.
It is an amenable number.
1069145 is a deficient number, since it is larger than the sum of its proper divisors (530983).
1069145 is a wasteful number, since it uses less digits than its factorization.
1069145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2800.
The product of its (nonzero) digits is 1080, while the sum is 26.
The square root of 1069145 is about 1033.9946808374. The cubic root of 1069145 is about 102.2536618707.
The spelling of 1069145 in words is "one million, sixty-nine thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •