Search a number
-
+
260225701632 = 28321331476789
BaseRepresentation
bin1111001001011010101…
…0010001011100000000
3220212200120120022200100
43302112222101130000
513230420234423012
6315313535522400
724541430652651
oct3622652213400
9825616508610
10260225701632
11a03a7696236
1242525089400
131b701762010
14c848927528
156b8090b8dc
hex3c96a91700

260225701632 has 864 divisors, whose sum is σ = 874248560640. Its totient is φ = 73866608640.

The previous prime is 260225701591. The next prime is 260225701633. The reversal of 260225701632 is 236107522062.

260225701632 is a `hidden beast` number, since 2 + 6 + 0 + 22 + 570 + 1 + 63 + 2 = 666.

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

It is a congruent number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2923884244 + ... + 2923884332.

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

Almost surely, 2260225701632 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 60480, while the sum is 36.

The spelling of 260225701632 in words is "two hundred sixty billion, two hundred twenty-five million, seven hundred one thousand, six hundred thirty-two".