Search a number
-
+
264126464000 = 217537347
BaseRepresentation
bin1111010111111100101…
…0100000000000000000
3221020202102112120200122
43311333022200000000
513311412333322000
6321201002435412
725040204621000
oct3657712400000
9836672476618
10264126464000
11a2019559793
1243233502b68
131bba3948c29
14cad8a08000
156d0d0cd085
hex3d7f2a0000

264126464000 has 576 divisors, whose sum is σ = 785170713600. Its totient is φ = 88630886400.

The previous prime is 264126463837. The next prime is 264126464009. The reversal of 264126464000 is 464621462.

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

It is a congruent number.

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

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

Almost surely, 2264126464000 is an apocalyptic number.

264126464000 is a gapful number since it is divisible by the number (20) 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 264126464000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (392585356800).

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

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

264126464000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 55296, while the sum is 35.

The spelling of 264126464000 in words is "two hundred sixty-four billion, one hundred twenty-six million, four hundred sixty-four thousand".