Search a number
-
+
10111000109490 = 2325734343917351
BaseRepresentation
bin1001001100100010011010…
…0100011110000110110010
31022210121020222112001111200
42103020212210132012302
52311124312012000430
633300532422352030
72062332002613000
oct223104644360662
938717228461450
1010111000109490
113249061a721a5
1211736b558b616
13584603900397
1426d53708ba70
15128024c3e460
hex9322691e1b2

10111000109490 has 384 divisors, whose sum is σ = 31443489792000. Its totient is φ = 2252067753600.

The previous prime is 10111000109489. The next prime is 10111000109527. The reversal of 10111000109490 is 9490100011101.

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 191 ways as a sum of consecutive naturals, for example, 582724315 + ... + 582741665.

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

Almost surely, 210111000109490 is an apocalyptic number.

10111000109490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

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

The product of its (nonzero) digits is 324, while the sum is 27.

The spelling of 10111000109490 in words is "ten trillion, one hundred eleven billion, one hundred nine thousand, four hundred ninety".