Base | Representation |
---|---|
bin | 101100100110100101101111… |
… | …001011101010010100000000 |
3 | 221201120021111022112210211112 |
4 | 230212211233023222110000 |
5 | 201202440234044404310 |
6 | 1533113212354302452 |
7 | 56214343015415651 |
oct | 5446455713522400 |
9 | 851507438483745 |
10 | 196165906638080 |
11 | 57560548298515 |
12 | 1a002325287a28 |
13 | 855c49a36a8a2 |
14 | 36626a2863528 |
15 | 17a2ad33b6705 |
hex | b2696f2ea500 |
196165906638080 has 36 divisors (see below), whose sum is σ = 469878648247092. Its totient is φ = 78466362654720.
The previous prime is 196165906638077. The next prime is 196165906638103. The reversal of 196165906638080 is 80836609561691.
It can be written as a sum of positive squares in 2 ways, for example, as 139380880417024 + 56785026221056 = 11805968^2 + 7535584^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 196165906638080.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76627306001 + ... + 76627308560.
Almost surely, 2196165906638080 is an apocalyptic number.
196165906638080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
196165906638080 is an abundant number, since it is smaller than the sum of its proper divisors (273712741609012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196165906638080 is an equidigital number, since it uses as much as digits as its factorization.
196165906638080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153254614582 (or 153254614568 counting only the distinct ones).
The product of its (nonzero) digits is 100776960, while the sum is 68.
The spelling of 196165906638080 in words is "one hundred ninety-six trillion, one hundred sixty-five billion, nine hundred six million, six hundred thirty-eight thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •