Search a number
-
+
260950272 = 28311172379
BaseRepresentation
bin11111000110111…
…00100100000000
3200012000122110220
433203130210000
51013300402042
641521023040
76316016652
oct1743344400
9605018426
10260950272
11124332890
1273484a80
13420a795b
142692a6d2
1517d988ec
hexf8dc900

260950272 has 288 divisors, whose sum is σ = 847687680. Its totient is φ = 70287360.

The previous prime is 260950271. The next prime is 260950303. The reversal of 260950272 is 272059062.

It is a happy number.

It is a Harshad number since it is a multiple of its sum of digits (33).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (260950271) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3303129 + ... + 3303207.

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

Almost surely, 2260950272 is an apocalyptic number.

260950272 is a gapful number since it is divisible by the number (22) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 260950272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (423843840).

260950272 is an abundant number, since it is smaller than the sum of its proper divisors (586737408).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

260950272 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 15120, while the sum is 33.

The square root of 260950272 is about 16153.9553051257. The cubic root of 260950272 is about 639.0270633447.

The spelling of 260950272 in words is "two hundred sixty million, nine hundred fifty thousand, two hundred seventy-two".