Search a number
-
+
10110102000 = 243533745541
BaseRepresentation
bin10010110101001101…
…11110100111110000
3222002120221101200020
421122212332213300
5131201141231000
64351114323440
7505352310015
oct113246764760
928076841606
1010110102000
1143189862a9
121b61a29580
13c5175a09b
146bca2370c
153e28aaba0
hex25a9be9f0

10110102000 has 160 divisors (see below), whose sum is σ = 33476649024. Its totient is φ = 2623104000.

The previous prime is 10110101971. The next prime is 10110102029. The reversal of 10110102000 is 20101101.

It is an interprime number because it is at equal distance from previous prime (10110101971) and next prime (10110102029).

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 a self number, because there is not a number n which added to its sum of digits gives 10110102000.

It is a congruent number.

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 31 ways as a sum of consecutive naturals, for example, 199230 + ... + 244770.

Almost surely, 210110102000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 10110102000 its reverse (20101101), we get a palindrome (10130203101).

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

Divisors: 1 2 3 4 5 6 8 10 12 15 16 20 24 25 30 37 40 48 50 60 74 75 80 100 111 120 125 148 150 185 200 222 240 250 296 300 370 375 400 444 500 555 592 600 740 750 888 925 1000 1110 1200 1480 1500 1776 1850 2000 2220 2775 2960 3000 3700 4440 4625 5550 6000 7400 8880 9250 11100 13875 14800 18500 22200 27750 37000 44400 45541 55500 74000 91082 111000 136623 182164 222000 227705 273246 364328 455410 546492 683115 728656 910820 1092984 1138525 1366230 1685017 1821640 2185968 2277050 2732460 3370034 3415575 3643280 4554100 5055051 5464920 5692625 6740068 6831150 8425085 9108200 10110102 10929840 11385250 13480136 13662300 16850170 17077875 18216400 20220204 22770500 25275255 26960272 27324600 33700340 34155750 40440408 42125425 45541000 50550510 54649200 67400680 68311500 80880816 84250850 91082000 101101020 126376275 134801360 136623000 168501700 202202040 210627125 252752550 273246000 337003400 404404080 421254250 505505100 631881375 674006800 842508500 1011010200 1263762750 1685017000 2022020400 2527525500 3370034000 5055051000 10110102000