Cookie Consent by FreePrivacyPolicy.com
Search a number
BaseRepresentation
bin110000000000000000
3100222200210
4300000000
522242413
64114120
71446126
oct600000
9328623
10196608
11124795
1295940
136b649
1451916
153d3c3
hex30000

196608 has 34 divisors (see below), whose sum is σ = 524284. Its totient is φ = 65536.

The previous prime is 196597. The next prime is 196613. The reversal of 196608 is 806691.

It is a Jordan-Polya number, since it can be written as 4! ⋅ (2!)13.

It is a nialpdrome in base 2, base 4, base 8 and base 16.

It is a zygodrome in base 2.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (2) of ones.

In principle, a polygon with 196608 sides can be constructed with ruler and compass.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65535 + 65536 + 65537.

196608 is a Friedman number, since it can be written as (8^6*6)/(9-1-0), using all its digits and the basic arithmetic operations.

2196608 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 196608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (262142).

196608 is an abundant number, since it is smaller than the sum of its proper divisors (327676).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

196608 is an frugal number, since it uses more digits than its factorization.

196608 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 35 (or 5 counting only the distinct ones).

The product of its (nonzero) digits is 2592, while the sum is 30.

The square root of 196608 is about 443.4050067376. The cubic root of 196608 is about 58.1478589706.

The spelling of 196608 in words is "one hundred ninety-six thousand, six hundred eight".
{"ft_lang_label":"__label__en","ft_lang_prob":0.91741973,"math_prob":0.99395186,"size":1812,"snap":"2022-40-2023-06","text_gpt3_token_len":503,"char_repetition_ratio":0.1659292,"word_repetition_ratio":0.033846155,"special_character_ratio":0.33498895,"punctuation_ratio":0.13766234,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.993789,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-02T17:06:18Z\",\"WARC-Record-ID\":\"<urn:uuid:cfb6edf7-3a2d-40d9-b05e-94f9771f4151>\",\"Content-Length\":\"9915\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:677403d7-9059-4291-af1d-505e6750e2d8>\",\"WARC-Concurrent-To\":\"<urn:uuid:518222d3-8c0a-4ccf-a6c5-35a1448c7655>\",\"WARC-IP-Address\":\"62.149.142.170\",\"WARC-Target-URI\":\"https://www.numbersaplenty.com/196608\",\"WARC-Payload-Digest\":\"sha1:MFMWOV5ARM56QOBXDAYPCELW62C7YEY5\",\"WARC-Block-Digest\":\"sha1:5X72KYJ7ZUML5J3BZFFCPMZDAPB72S4X\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337338.11_warc_CC-MAIN-20221002150039-20221002180039-00196.warc.gz\"}"}