Search a number
BaseRepresentation
bin100001010000110010101
32001101010012
410022012111
5234334231
635210005
712156446
oct4120625
92041105
101089941
11684986
12446905
132c2148
142052cd
15167e2b
hex10a195

1089941 has 2 divisors, whose sum is σ = 1089942. Its totient is φ = 1089940.

The previous prime is 1089919. The next prime is 1089943. The reversal of 1089941 is 1499801.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 970225 + 119716 = 985^2 + 346^2 .

It is a cyclic number.

It is not a de Polignac number, because 1089941 - 26 = 1089877 is a prime.

Together with 1089943, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 1089898 and 1089907.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1089943) by changing a digit.

It is a good prime.

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

It is an arithmetic number, because the mean of its divisors is an integer number (544971).

21089941 is an apocalyptic number.

It is an amenable number.

1089941 is a deficient number, since it is larger than the sum of its proper divisors (1).

1089941 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The square root of 1089941 is about 1044.0023946333. The cubic root of 1089941 is about 102.9123897611.

The spelling of 1089941 in words is "one million, eighty-nine thousand, nine hundred forty-one".
{"ft_lang_label":"__label__en","ft_lang_prob":0.889891,"math_prob":0.98781675,"size":1813,"snap":"2020-24-2020-29","text_gpt3_token_len":564,"char_repetition_ratio":0.16970702,"word_repetition_ratio":0.031055901,"special_character_ratio":0.44180915,"punctuation_ratio":0.13636364,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9970659,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-06-03T09:18:47Z\",\"WARC-Record-ID\":\"<urn:uuid:c080acf0-5e4a-441c-9169-f700c63f08f4>\",\"Content-Length\":\"8829\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d33a47fc-273f-42dd-941c-9022dc003036>\",\"WARC-Concurrent-To\":\"<urn:uuid:fea9de4f-1e6a-4217-8585-958be8b8805b>\",\"WARC-IP-Address\":\"62.149.142.170\",\"WARC-Target-URI\":\"http://www.numbersaplenty.com/1089941\",\"WARC-Payload-Digest\":\"sha1:ZFGVE3X6SFFOGMQIA5RIZKWNI7MFNZQN\",\"WARC-Block-Digest\":\"sha1:CUA6XCBBPFLEYPOTGJMN43RI4VL4LG3M\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347432521.57_warc_CC-MAIN-20200603081823-20200603111823-00339.warc.gz\"}"}