Search a number
-
+
495115680000 = 28354192332
BaseRepresentation
bin1110011010001110011…
…00011011100100000000
31202022222110111112210210
413031013030123210000
531102444103230000
61015241503154120
750525266561344
oct7150714334400
91668873445723
10495115680000
11180a829915a7
127bb592a5940
13378c62629b6
1419d6c675624
15cd2be2c350
hex734731b900

495115680000 has 540 divisors, whose sum is σ = 1740771087440. Its totient is φ = 124545024000.

The previous prime is 495115679987. The next prime is 495115680001. The reversal of 495115680000 is 86511594.

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

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 in 59 ways as a sum of consecutive naturals, for example, 2124959884 + ... + 2124960116.

Almost surely, 2495115680000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 43200, while the sum is 39.

The spelling of 495115680000 in words is "four hundred ninety-five billion, one hundred fifteen million, six hundred eighty thousand".