Base | Representation |
---|---|
bin | 10010001100110000… |
… | …001110001000001000 |
3 | 1212102212102220212000 |
4 | 102030300032020020 |
5 | 310010034221300 |
6 | 12551022151000 |
7 | 1261152324003 |
oct | 221460161010 |
9 | 55385386760 |
10 | 19541320200 |
11 | 8318625106 |
12 | 3954422460 |
13 | 1ac565c27c |
14 | d3540853a |
15 | 795865c00 |
hex | 48cc0e208 |
19541320200 has 288 divisors, whose sum is σ = 68179490400. Its totient is φ = 5144290560.
The previous prime is 19541320199. The next prime is 19541320217. The reversal of 19541320200 is 202314591.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 119885319 + ... + 119885481.
Almost surely, 219541320200 is an apocalyptic number.
19541320200 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 19541320200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34089745200).
19541320200 is an abundant number, since it is smaller than the sum of its proper divisors (48638170200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19541320200 is a wasteful number, since it uses less digits than its factorization.
19541320200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486 (or 322 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 19541320200 its reverse (202314591), we get a palindrome (19743634791).
The spelling of 19541320200 in words is "nineteen billion, five hundred forty-one million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •