Search a number
-
+
56051465 = 5171016529
BaseRepresentation
bin1101010111010…
…0011100001001
310220110201011012
43111310130021
5103322121330
65321213305
71250300231
oct325643411
9126421135
1056051465
1129704328
1216931235
13b7c6962
147630cc1
154dc2c95
hex3574709

56051465 has 16 divisors (see below), whose sum is σ = 71934480. Its totient is φ = 41779200.

The previous prime is 56051449. The next prime is 56051473. The reversal of 56051465 is 56415065.

56051465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 8 ways, for example, as 891136 + 55160329 = 944^2 + 7427^2 .

It is not a de Polignac number, because 56051465 - 24 = 56051449 is a prime.

It is a Curzon number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5321 + ... + 11849.

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

Almost surely, 256051465 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6652.

The product of its (nonzero) digits is 18000, while the sum is 32.

The square root of 56051465 is about 7486.7526338193. The cubic root of 56051465 is about 382.7034018639.

It can be divided in two parts, 560 and 51465, that added together give a palindrome (52025).

The spelling of 56051465 in words is "fifty-six million, fifty-one thousand, four hundred sixty-five".

Divisors: 1 5 17 85 101 505 1717 6529 8585 32645 110993 554965 659429 3297145 11210293 56051465