Search a number
-
+
10002101101110 = 2335612112128753
BaseRepresentation
bin1001000110001100101110…
…1011101110001000110110
31022102012011121211020201000
42101203023223232020312
52302333300340213420
633134522442544130
72051425250405436
oct221431353561066
938365147736630
1010002101101110
11320695a354418
121156583508046
1357726a540611
142681661c42c6
1512529e626690
hex918cbaee236

10002101101110 has 128 divisors (see below), whose sum is σ = 27111746344320. Its totient is φ = 2623286476800.

The previous prime is 10002101101103. The next prime is 10002101101123. The reversal of 10002101101110 is 1110110120001.

10002101101110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a Curzon number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 347848494 + ... + 347877246.

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

Almost surely, 210002101101110 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 10002101101110 its reverse (1110110120001), we get a palindrome (11112211221111).

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

Divisors: 1 2 3 5 6 9 10 15 18 27 30 45 54 61 90 122 135 183 270 305 366 549 610 915 1098 1647 1830 2745 3294 5490 8235 16470 21121 28753 42242 57506 63363 86259 105605 126726 143765 172518 190089 211210 258777 287530 316815 380178 431295 517554 570267 633630 776331 862590 950445 1140534 1288381 1293885 1552662 1753933 1900890 2576762 2587770 2851335 3507866 3865143 3881655 5261799 5702670 6441905 7730286 7763310 8769665 10523598 11595429 12883810 15785397 17539330 19325715 23190858 26308995 31570794 34786287 38651430 47356191 52617990 57977145 69572574 78926985 94712382 115954290 157853970 173931435 236780955 347862870 473561910 607292113 1214584226 1821876339 3036460565 3643752678 5465629017 6072921130 9109381695 10931258034 16396887051 18218763390 27328145085 32793774102 37044818893 54656290170 74089637786 81984435255 111134456679 163968870510 185224094465 222268913358 333403370037 370448188930 555672283395 666806740074 1000210110111 1111344566790 1667016850185 2000420220222 3334033700370 5001050550555 10002101101110