Search a number
-
+
10001011100100 = 22352371171769421
BaseRepresentation
bin1001000110001000101010…
…1101101100100111000100
31022102002100122210110102020
42101202022231230213010
52302324032320200400
633134222344243140
72051356243506066
oct221421255544704
938362318713366
1010001011100100
113206450049539
12115631a4704b0
13577125780bc7
142680a1529736
15125238ab82a0
hex9188ab6c9c4

10001011100100 has 144 divisors (see below), whose sum is σ = 29743737070656. Its totient is φ = 2592637632000.

The previous prime is 10001011100089. The next prime is 10001011100131. The reversal of 10001011100100 is 100111010001.

It is a Harshad number since it is a multiple of its sum of digits (6).

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is an unprimeable number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 12613390 + ... + 13382810.

Almost surely, 210001011100100 is an apocalyptic number.

10001011100100 is a gapful number since it is divisible by the number (10) 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 10001011100100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14871868535328).

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

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 6.

Adding to 10001011100100 its reverse (100111010001), we get a palindrome (10101122110101).

Subtracting from 10001011100100 its reverse (100111010001), we obtain a palindrome (9900900090099).

The spelling of 10001011100100 in words is "ten trillion, one billion, eleven million, one hundred thousand, one hundred".

Divisors: 1 2 3 4 5 6 10 12 15 20 25 30 37 50 60 74 75 100 111 148 150 185 222 300 370 444 555 740 925 1110 1171 1850 2220 2342 2775 3513 3700 4684 5550 5855 7026 11100 11710 14052 17565 23420 29275 35130 43327 58550 70260 86654 87825 117100 129981 173308 175650 216635 259962 351300 433270 519924 649905 769421 866540 1083175 1299810 1538842 2166350 2308263 2599620 3077684 3249525 3847105 4332700 4616526 6499050 7694210 9233052 11541315 12998100 15388420 19235525 23082630 28468577 38471050 46165260 56937154 57706575 76942100 85405731 113874308 115413150 142342885 170811462 230826300 284685770 341622924 427028655 569371540 711714425 854057310 900991991 1423428850 1708114620 1801983982 2135143275 2702975973 2846857700 3603967964 4270286550 4504959955 5405951946 8540573100 9009919910 10811903892 13514879865 18019839820 22524799775 27029759730 33336703667 45049599550 54059519460 66673407334 67574399325 90099199100 100010111001 133346814668 135148798650 166683518335 200020222002 270297597300 333367036670 400040444004 500050555005 666734073340 833417591675 1000101110010 1666835183350 2000202220020 2500252775025 3333670366700 5000505550050 10001011100100