Base | Representation |
---|---|
bin | 10111011110101… |
… | …01011000000000 |
3 | 111201121111011111 |
4 | 23233111120000 |
5 | 400410121241 |
6 | 31313253104 |
7 | 4611053455 |
oct | 1357253000 |
9 | 451544144 |
10 | 196957696 |
11 | a11a5261 |
12 | 55b64194 |
13 | 31a60620 |
14 | 1c22d82c |
15 | 12457c81 |
hex | bbd5600 |
196957696 has 80 divisors (see below), whose sum is σ = 428972544. Its totient is φ = 89800704.
The previous prime is 196957687. The next prime is 196957703. The reversal of 196957696 is 696759691.
It is a self number, because there is not a number n which added to its sum of digits gives 196957696.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 845196 + ... + 845428.
Almost surely, 2196957696 is an apocalyptic number.
196957696 is a gapful number since it is divisible by the number (16) 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 196957696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214486272).
196957696 is an abundant number, since it is smaller than the sum of its proper divisors (232014848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196957696 is a wasteful number, since it uses less digits than its factorization.
196957696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391 (or 375 counting only the distinct ones).
The product of its digits is 5511240, while the sum is 58.
The square root of 196957696 is about 14034.1617491035. The cubic root of 196957696 is about 581.8231336700.
The spelling of 196957696 in words is "one hundred ninety-six million, nine hundred fifty-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •