Search a number
-
+
49410912000 = 28353472233
BaseRepresentation
bin101110000001000111…
…101010111100000000
311201112112100101210210
4232001013222330000
51302143143141000
634410555154120
73366306552012
oct560107527400
9151475311723
1049410912000
1119a5619856a
1296ab745940
1348759c4b48
14256a3c81b2
151442cd0350
hexb811eaf00

49410912000 has 432 divisors, whose sum is σ = 168404195232. Its totient is φ = 12840550400.

The previous prime is 49410911923. The next prime is 49410912013. The reversal of 49410912000 is 21901494.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 212063884 + ... + 212064116.

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

Almost surely, 249410912000 is an apocalyptic number.

49410912000 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 49410912000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84202097616).

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

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

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 30.

The spelling of 49410912000 in words is "forty-nine billion, four hundred ten million, nine hundred twelve thousand".