Search a number
BaseRepresentation
bin100110001001…
…011010100110
3200211001110210
4212021122212
510030000123
6554200250
7150666426
oct46113246
920731423
1010000038
1157101a4
123423086
1320c18a9
141484486
15d27e93
hex9896a6

10000038 has 16 divisors (see below), whose sum is σ = 20033280. Its totient is φ = 3327816.

The previous prime is 10000019. The next prime is 10000079. The reversal of 10000038 is 83000001.

Adding to 10000038 its reverse (83000001), we get a palindrome (93000039).

It is an Ulam number.

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4383 + ... + 6261.

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

Almost surely, 210000038 is an apocalyptic number.

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

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

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

10000038 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2771.

The product of its (nonzero) digits is 24, while the sum is 12.

The square root of 10000038 is about 3162.2836684902. The cubic root of 10000038 is about 215.4437418979.

The spelling of 10000038 in words is "ten million, thirty-eight", and thus it is an aban number and an uban number.
{"ft_lang_label":"__label__en","ft_lang_prob":0.85918224,"math_prob":0.9963098,"size":1841,"snap":"2019-35-2019-39","text_gpt3_token_len":562,"char_repetition_ratio":0.17583016,"word_repetition_ratio":0.0063897762,"special_character_ratio":0.4394351,"punctuation_ratio":0.13535912,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99742097,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-15T18:32:46Z\",\"WARC-Record-ID\":\"<urn:uuid:a1986279-b944-44c7-a232-b6916435e37a>\",\"Content-Length\":\"9261\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3ef5deb0-4988-40a2-b1ce-39a65f74fd06>\",\"WARC-Concurrent-To\":\"<urn:uuid:db5e0187-0395-4b91-9113-a730928eb33a>\",\"WARC-IP-Address\":\"62.149.142.170\",\"WARC-Target-URI\":\"http://www.numbersaplenty.com/10000038\",\"WARC-Payload-Digest\":\"sha1:VG6M5BUGNOIVWLQULLBHAI7JPYWS6HQL\",\"WARC-Block-Digest\":\"sha1:XL3K6W6QVR5AMZ7WKGFNXNTUWS4KBVH6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514572235.63_warc_CC-MAIN-20190915175150-20190915201150-00327.warc.gz\"}"}