Search a number
-
+
10145142500 = 225429413413
BaseRepresentation
bin10010111001011001…
…01001011011100100
3222012000212122012112
421130230221123210
5131234124030000
64354405340152
7506256200633
oct113454513344
928160778175
1010145142500
114336739799
121b71707658
13c58aa83cc
146c354551a
153e59cd235
hex25cb296e4

10145142500 has 120 divisors (see below), whose sum is σ = 23517065880. Its totient is φ = 3821440000.

The previous prime is 10145142493. The next prime is 10145142503. The reversal of 10145142500 is 524154101.

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

It can be written as a sum of positive squares in 20 ways, for example, as 10019209216 + 125933284 = 100096^2 + 11222^2 .

It is a super-3 number, since 3×101451425003 (a number of 31 digits) contains 333 as substring.

It is not an unprimeable number, because it can be changed into a prime (10145142503) by changing a digit.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2970794 + ... + 2974206.

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

Almost surely, 210145142500 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 800, while the sum is 23.

Adding to 10145142500 its reverse (524154101), we get a palindrome (10669296601).

The spelling of 10145142500 in words is "ten billion, one hundred forty-five million, one hundred forty-two thousand, five hundred".

Divisors: 1 2 4 5 10 20 25 29 41 50 58 82 100 116 125 145 164 205 250 290 410 500 580 625 725 820 1025 1189 1250 1450 2050 2378 2500 2900 3413 3625 4100 4756 5125 5945 6826 7250 10250 11890 13652 14500 17065 18125 20500 23780 25625 29725 34130 36250 51250 59450 68260 72500 85325 98977 102500 118900 139933 148625 170650 197954 279866 297250 341300 395908 426625 494885 559732 594500 699665 743125 853250 989770 1399330 1486250 1706500 1979540 2133125 2474425 2798660 2972500 3498325 4058057 4266250 4948850 6996650 8116114 8532500 9897700 12372125 13993300 16232228 17491625 20290285 24744250 34983250 40580570 49488500 61860625 69966500 81161140 87458125 101451425 123721250 174916250 202902850 247442500 349832500 405805700 507257125 1014514250 2029028500 2536285625 5072571250 10145142500