Base | Representation |
---|---|
bin | 10111010111011… |
… | …11110100000000 |
3 | 111122211201100000 |
4 | 23223233310000 |
5 | 400140024113 |
6 | 31241200000 |
7 | 4600056216 |
oct | 1353576400 |
9 | 448751300 |
10 | 196017408 |
11 | a0712864 |
12 | 55790000 |
13 | 317c1642 |
14 | 1c066cb6 |
15 | 1231e373 |
hex | baefd00 |
196017408 has 216 divisors, whose sum is σ = 616045248. Its totient is φ = 62042112.
The previous prime is 196017323. The next prime is 196017413. The reversal of 196017408 is 804710691.
196017408 is a `hidden beast` number, since 1 + 9 + 601 + 7 + 40 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (216).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1430716 + ... + 1430852.
Almost surely, 2196017408 is an apocalyptic number.
196017408 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 196017408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (308022624).
196017408 is an abundant number, since it is smaller than the sum of its proper divisors (420027840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196017408 is an equidigital number, since it uses as much as digits as its factorization.
196017408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191 (or 165 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The square root of 196017408 is about 14000.6217004817. The cubic root of 196017408 is about 580.8957700143.
The spelling of 196017408 in words is "one hundred ninety-six million, seventeen thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.076 sec. • engine limits •