Search a number
-
+
19519272000 = 263353233929
BaseRepresentation
bin10010001011011100…
…000111010001000000
31212101022221202102000
4102023130013101000
5304433413201000
612544513424000
71260464034354
oct221334072100
955338852360
1019519272000
118307135a58
123948b6b000
131ac0c0c7b7
14d32509464
1579395d000
hex48b707440

19519272000 has 448 divisors, whose sum is σ = 74746713600. Its totient is φ = 4977561600.

The previous prime is 19519271983. The next prime is 19519272001. The reversal of 19519272000 is 27291591.

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

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

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, 4966036 + ... + 4969964.

Almost surely, 219519272000 is an apocalyptic number.

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

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

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

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

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

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

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

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