Search a number
BaseRepresentation
bin101110000
3111122
411300
52433
61412
71034
oct560
9448
10368
11305
12268
13224
141c4
15198
hex170

368 has 10 divisors (see below), whose sum is σ = 744. Its totient is φ = 176.

The previous prime is 367. The next prime is 373. The reversal of 368 is 863.

Subtracting from 368 its sum of digits (17), we obtain a triangular number (351 = T26).

Adding to 368 its product of digits (144), we get a 9-th power (512 = 29).

It can be divided in two parts, 36 and 8, that added together give a palindrome (44).

It is a happy number.

It is a Leyland number of the form 53 + 35.

It is a plaindrome in base 3, base 9, base 10, base 12 and base 13.

It is a zygodrome in base 3.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (367) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5 + ... + 27.

It is an amenable number.

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

368 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

368 is a wasteful number, since it uses less digits than its factorization.

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

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

The product of its digits is 144, while the sum is 17.

The square root of 368 is about 19.1833260933. The cubic root of 368 is about 7.1660957420.

The spelling of 368 in words is "three hundred sixty-eight", and thus it is an aban number and an oban number.

Divisors: 1 2 4 8 16 23 46 92 184 368
{"ft_lang_label":"__label__en","ft_lang_prob":0.9307682,"math_prob":0.996571,"size":1832,"snap":"2020-24-2020-29","text_gpt3_token_len":506,"char_repetition_ratio":0.16411379,"word_repetition_ratio":0.005602241,"special_character_ratio":0.32041484,"punctuation_ratio":0.14043583,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9973179,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-02T12:41:41Z\",\"WARC-Record-ID\":\"<urn:uuid:7b1d45ef-61e4-4377-b1cc-55fb113feca0>\",\"Content-Length\":\"9202\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:850349c1-d786-4bd5-be62-28f0c0b55c70>\",\"WARC-Concurrent-To\":\"<urn:uuid:b7b3aebb-8511-45c5-9fc9-6cb34bd65185>\",\"WARC-IP-Address\":\"62.149.142.170\",\"WARC-Target-URI\":\"http://www.numbersaplenty.com/368\",\"WARC-Payload-Digest\":\"sha1:HV2S2F2DJTCYBVHUUUN6ZZREF2NG4O7S\",\"WARC-Block-Digest\":\"sha1:S7LSJFCGASCZ2VAKX4JD2VTXTGUW6KKD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655878753.12_warc_CC-MAIN-20200702111512-20200702141512-00490.warc.gz\"}"}