Base | Representation |
---|---|
bin | 100000010100110011101 |
3 | 1222210222201 |
4 | 10002212131 |
5 | 232343404 |
6 | 34411501 |
7 | 12001063 |
oct | 4024635 |
9 | 1883881 |
10 | 1059229 |
11 | 6638a6 |
12 | 430b91 |
13 | 2b1182 |
14 | 1d8033 |
15 | 15dca4 |
hex | 10299d |
1059229 has 4 divisors (see below), whose sum is σ = 1061820. Its totient is φ = 1056640.
The previous prime is 1059221. The next prime is 1059251. The reversal of 1059229 is 9229501.
1059229 is nontrivially palindromic in base 9.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9229501 = 113 ⋅81677.
It can be written as a sum of positive squares in 2 ways, for example, as 643204 + 416025 = 802^2 + 645^2 .
It is a cyclic number.
It is not a de Polignac number, because 1059229 - 23 = 1059221 is a prime.
It is a super-2 number, since 2×10592292 = 2243932148882, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1059197 and 1059206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1059221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 532 + ... + 1549.
It is an arithmetic number, because the mean of its divisors is an integer number (265455).
21059229 is an apocalyptic number.
It is an amenable number.
1059229 is a deficient number, since it is larger than the sum of its proper divisors (2591).
1059229 is an equidigital number, since it uses as much as digits as its factorization.
1059229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2590.
The product of its (nonzero) digits is 1620, while the sum is 28.
The square root of 1059229 is about 1029.1885152877. The cubic root of 1059229 is about 101.9365554447.
The spelling of 1059229 in words is "one million, fifty-nine thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •