Search a number
-
+
256605152 = 258018911
BaseRepresentation
bin11110100101101…
…11101111100000
3122212211220002112
433102313233200
51011142331102
641243534452
76234051656
oct1722675740
9585756075
10256605152
11121935281
1271b2a428
1341215c8b
1426118dd6
15177db252
hexf4b7be0

256605152 has 12 divisors (see below), whose sum is σ = 505191456. Its totient is φ = 128302560.

The previous prime is 256605143. The next prime is 256605161. The reversal of 256605152 is 251506652.

It is an interprime number because it is at equal distance from previous prime (256605143) and next prime (256605161).

It is a Harshad number since it is a multiple of its sum of digits (32), and also a Moran number because the ratio is a prime number: 8018911 = 256605152 / (2 + 5 + 6 + 6 + 0 + 5 + 1 + 5 + 2).

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4009424 + ... + 4009487.

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

Almost surely, 2256605152 is an apocalyptic number.

It is an amenable number.

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

256605152 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 8018921 (or 8018913 counting only the distinct ones).

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

The square root of 256605152 is about 16018.8998373796. The cubic root of 256605152 is about 635.4603494259.

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

Divisors: 1 2 4 8 16 32 8018911 16037822 32075644 64151288 128302576 256605152