Search a number
-
+
106115010065010 = 232510124114841899
BaseRepresentation
bin11000001000001011010011…
…011110101111001001110010
3111220201111101111120201201100
4120020023103132233021302
5102402042020034040020
61013404321310345230
731231361605111422
oct3010132336571162
9456644344521640
10106115010065010
11308a2139850731
12ba999721bb216
1347297aa94683b
141c2bdcb346482
15c404655e3a90
hex6082d37af272

106115010065010 has 96 divisors (see below), whose sum is σ = 278746323710400. Its totient is φ = 28005538032000.

The previous prime is 106115010064933. The next prime is 106115010065123. The reversal of 106115010065010 is 10560010511601.

106115010065010 is a `hidden beast` number, since 1 + 0 + 6 + 1 + 1 + 5 + 0 + 1 + 0 + 0 + 650 + 1 + 0 = 666.

It is a super-2 number, since 2×1061150100650102 (a number of 29 digits) contains 22 as substring.

It is an unprimeable number.

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

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

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

Almost surely, 2106115010065010 is an apocalyptic number.

106115010065010 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 106115010065010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139373161855200).

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

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

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

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

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

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

Adding to 106115010065010 its reverse (10560010511601), we get a palindrome (116675020576611).

The spelling of 106115010065010 in words is "one hundred six trillion, one hundred fifteen billion, ten million, sixty-five thousand, ten".

Divisors: 1 2 3 5 6 9 10 15 18 30 45 90 101 202 303 505 606 909 1010 1515 1818 2411 3030 4545 4822 7233 9090 12055 14466 21699 24110 36165 43398 72330 108495 216990 243511 487022 730533 1217555 1461066 2191599 2435110 3652665 4383198 4841899 7305330 9683798 10957995 14525697 21915990 24209495 29051394 43577091 48418990 72628485 87154182 145256970 217885455 435770910 489031799 978063598 1467095397 2445158995 2934190794 4401286191 4890317990 7335476985 8802572382 11673818489 14670953970 22006430955 23347636978 35021455467 44012861910 58369092445 70042910934 105064366401 116738184890 175107277335 210128732802 350214554670 525321832005 1050643664010 1179055667389 2358111334778 3537167002167 5895278336945 7074334004334 10611501006501 11790556673890 17685835010835 21223002013002 35371670021670 53057505032505 106115010065010