Base | Representation |
---|---|
bin | 100000001110111101011 |
3 | 1222122212211 |
4 | 10001313223 |
5 | 232244420 |
6 | 34345551 |
7 | 11656255 |
oct | 4016753 |
9 | 1878784 |
10 | 1056235 |
11 | 661624 |
12 | 42b2b7 |
13 | 2ac9bb |
14 | 1d6cd5 |
15 | 15ce5a |
hex | 101deb |
1056235 has 4 divisors (see below), whose sum is σ = 1267488. Its totient is φ = 844984.
The previous prime is 1056217. The next prime is 1056241. The reversal of 1056235 is 5326501.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1056235 - 25 = 1056203 is a prime.
It is a super-3 number, since 3×10562353 = 3535109885537333625, which contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105619 + ... + 105628.
It is an arithmetic number, because the mean of its divisors is an integer number (316872).
21056235 is an apocalyptic number.
1056235 is a deficient number, since it is larger than the sum of its proper divisors (211253).
1056235 is an equidigital number, since it uses as much as digits as its factorization.
1056235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211252.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 1056235 is about 1027.7329419650. The cubic root of 1056235 is about 101.8404207230.
It can be divided in two parts, 1056 and 235, that multiplied together give a triangular number (248160 = T704).
The spelling of 1056235 in words is "one million, fifty-six thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •