Base | Representation |
---|---|
bin | 1011011101000110010… |
… | …1100110101000000000 |
3 | 200210221121202211220000 |
4 | 2313101211212220000 |
5 | 11211011143332000 |
6 | 230223132520000 |
7 | 20134430622210 |
oct | 2672145465000 |
9 | 623847684800 |
10 | 196789824000 |
11 | 765047a8490 |
12 | 32180620000 |
13 | 15732229953 |
14 | 974ba08240 |
15 | 51bb716000 |
hex | 2dd1966a00 |
196789824000 has 3200 divisors, whose sum is σ = 1001038072320. Its totient is φ = 37158912000.
The previous prime is 196789823987. The next prime is 196789824037. The reversal of 196789824000 is 428987691.
196789824000 is a `hidden beast` number, since 1 + 96 + 78 + 9 + 82 + 400 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (3200).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 319 ways as a sum of consecutive naturals, for example, 6785855986 + ... + 6785856014.
Almost surely, 2196789824000 is an apocalyptic number.
196789824000 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 196789824000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (500519036160).
196789824000 is an abundant number, since it is smaller than the sum of its proper divisors (804248248320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196789824000 is a wasteful number, since it uses less digits than its factorization.
196789824000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109 (or 74 counting only the distinct ones).
The product of its (nonzero) digits is 1741824, while the sum is 54.
The spelling of 196789824000 in words is "one hundred ninety-six billion, seven hundred eighty-nine million, eight hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •