Search a number
-
+
1056513 = 34759127
BaseRepresentation
bin100000001111100000001
31222200021010
410001330001
5232302023
634351133
711660133
oct4017401
91880233
101056513
11661857
1242b4a9
132acb73
141d7053
1515d093
hex101f01

1056513 has 16 divisors (see below), whose sum is σ = 1474560. Its totient is φ = 672336.

The previous prime is 1056509. The next prime is 1056521. The reversal of 1056513 is 3156501.

It is a happy number.

1056513 is nontrivially palindromic in base 2.

It is not a de Polignac number, because 1056513 - 22 = 1056509 is a prime.

It is a super-2 number, since 2×10565132 = 2232439438338, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1056513.

It is not an unprimeable number, because it can be changed into a prime (1056563) 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, 8256 + ... + 8382.

It is an arithmetic number, because the mean of its divisors is an integer number (92160).

21056513 is an apocalyptic number.

It is an amenable number.

1056513 is a deficient number, since it is larger than the sum of its proper divisors (418047).

1056513 is a wasteful number, since it uses less digits than its factorization.

1056513 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 236.

The product of its (nonzero) digits is 450, while the sum is 21.

The square root of 1056513 is about 1027.8681822102. The cubic root of 1056513 is about 101.8493547050.

It can be divided in two parts, 105 and 6513, that multiplied together give a triangular number (683865 = T1169).

The spelling of 1056513 in words is "one million, fifty-six thousand, five hundred thirteen".

Divisors: 1 3 47 59 127 141 177 381 2773 5969 7493 8319 17907 22479 352171 1056513