Base | Representation |
---|---|
bin | 100000100010111000001 |
3 | 2000011212112 |
4 | 10010113001 |
5 | 233111213 |
6 | 34505105 |
7 | 12031064 |
oct | 4042701 |
9 | 2004775 |
10 | 1066433 |
11 | 669255 |
12 | 435195 |
13 | 2b4534 |
14 | 1da8db |
15 | 160ea8 |
hex | 1045c1 |
1066433 has 2 divisors, whose sum is σ = 1066434. Its totient is φ = 1066432.
The previous prime is 1066423. The next prime is 1066447. The reversal of 1066433 is 3346601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 984064 + 82369 = 992^2 + 287^2 .
It is an emirp because it is prime and its reverse (3346601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1066433 - 210 = 1065409 is a prime.
It is a super-2 number, since 2×10664332 = 2274558686978, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1066399 and 1066408.
It is not a weakly prime, because it can be changed into another prime (1066423) 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 as a sum of consecutive naturals, namely, 533216 + 533217.
It is an arithmetic number, because the mean of its divisors is an integer number (533217).
21066433 is an apocalyptic number.
It is an amenable number.
1066433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1066433 is an equidigital number, since it uses as much as digits as its factorization.
1066433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 1066433 is about 1032.6824294041. The cubic root of 1066433 is about 102.1671295672.
The spelling of 1066433 in words is "one million, sixty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •