Base | Representation |
---|---|
bin | 11111111101100011000… |
… | …000011110100110110000 |
3 | 21202222021011001220210000 |
4 | 133331203000132212300 |
5 | 241441201133424000 |
6 | 4401001330310000 |
7 | 314453401335015 |
oct | 37754300364660 |
9 | 7688234056700 |
10 | 2196389358000 |
11 | 777535595232 |
12 | 2b5812428300 |
13 | 12c170818596 |
14 | 7843d21170c |
15 | 3c1ee48c000 |
hex | 1ff6301e9b0 |
2196389358000 has 800 divisors, whose sum is σ = 8420516552448. Its totient is φ = 549918720000.
The previous prime is 2196389357977. The next prime is 2196389358019. The reversal of 2196389358000 is 8539836912.
2196389358000 is a `hidden beast` number, since 21 + 9 + 6 + 38 + 9 + 3 + 580 + 0 + 0 = 666.
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 159 ways as a sum of consecutive naturals, for example, 1655153337 + ... + 1655154663.
Almost surely, 22196389358000 is an apocalyptic number.
2196389358000 is a gapful number since it is divisible by the number (20) 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 2196389358000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4210258276224).
2196389358000 is an abundant number, since it is smaller than the sum of its proper divisors (6224127194448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2196389358000 is a wasteful number, since it uses less digits than its factorization.
2196389358000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1980 (or 1955 counting only the distinct ones).
The product of its (nonzero) digits is 2799360, while the sum is 54.
The spelling of 2196389358000 in words is "two trillion, one hundred ninety-six billion, three hundred eighty-nine million, three hundred fifty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •