Base | Representation |
---|---|
bin | 10111011101000… |
… | …01000000000000 |
3 | 111201012120220000 |
4 | 23232201000000 |
5 | 400331240133 |
6 | 31304520000 |
7 | 4606201146 |
oct | 1356410000 |
9 | 451176800 |
10 | 196743168 |
11 | a1069066 |
12 | 55a80000 |
13 | 319b6a9b |
14 | 1c1b5596 |
15 | 12414413 |
hex | bba1000 |
196743168 has 130 divisors (see below), whose sum is σ = 588719934. Its totient is φ = 65470464.
The previous prime is 196743167. The next prime is 196743191. The reversal of 196743168 is 861347691.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 175509504 + 21233664 = 13248^2 + 4608^2 .
It is a nialpdrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (196743161) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 331480 + ... + 332072.
Almost surely, 2196743168 is an apocalyptic number.
196743168 is a gapful number since it is divisible by the number (18) 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 196743168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294359967).
196743168 is an abundant number, since it is smaller than the sum of its proper divisors (391976766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196743168 is an frugal number, since it uses more digits than its factorization.
196743168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629 (or 598 counting only the distinct ones).
The product of its digits is 217728, while the sum is 45.
The square root of 196743168 is about 14026.5166024926. The cubic root of 196743168 is about 581.6118146904.
The spelling of 196743168 in words is "one hundred ninety-six million, seven hundred forty-three thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •