Search a number
-
+
19562972000 = 25531113231487
BaseRepresentation
bin10010001110000010…
…110100001101100000
31212111101011221112112
4102032002310031200
5310031110101000
612553114214452
71261534342535
oct221602641540
955441157475
1019562972000
118329873460
12395b724428
131ac9ca04a0
14d38242d8c
157976e1235
hex48e0b4360

19562972000 has 384 divisors, whose sum is σ = 58964226048. Its totient is φ = 6276864000.

The previous prime is 19562971993. The next prime is 19562972041. The reversal of 19562972000 is 27926591.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13155257 + ... + 13156743.

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

Almost surely, 219562972000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 41.

The spelling of 19562972000 in words is "nineteen billion, five hundred sixty-two million, nine hundred seventy-two thousand".