Search a number
-
+
104411263353150 = 235213222511829759
BaseRepresentation
bin10111101111011000100100…
…010000110100000100111110
3111200200121201110120020001110
4113233120210100310010332
5102141133231404300100
61010021512221422450
730664315304030565
oct2757304420640476
9450617643506043
10104411263353150
11302a5628192066
12b863728a0aa26
134634c2ac13900
141bad764178bdc
15c10e9add3250
hex5ef62443413e

104411263353150 has 144 divisors (see below), whose sum is σ = 280515294443520. Its totient is φ = 25689802320000.

The previous prime is 104411263353143. The next prime is 104411263353151. The reversal of 104411263353150 is 51353362114401.

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

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

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

It is a congruent number.

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

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 71 ways as a sum of consecutive naturals, for example, 56147971 + ... + 57977729.

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

Almost surely, 2104411263353150 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 129600, while the sum is 39.

The spelling of 104411263353150 in words is "one hundred four trillion, four hundred eleven billion, two hundred sixty-three million, three hundred fifty-three thousand, one hundred fifty".

Divisors: 1 2 3 5 6 10 13 15 25 26 30 39 50 65 75 78 130 150 169 195 325 338 390 507 650 845 975 1014 1690 1950 2251 2535 4225 4502 5070 6753 8450 11255 12675 13506 22510 25350 29263 33765 56275 58526 67530 87789 112550 146315 168825 175578 292630 337650 380419 438945 731575 760838 877890 1141257 1463150 1829759 1902095 2194725 2282514 3659518 3804190 4389450 5489277 5706285 9148795 9510475 10978554 11412570 18297590 19020950 23786867 27446385 28531425 45743975 47573734 54892770 57062850 71360601 91487950 118934335 137231925 142721202 237868670 274463850 309229271 356803005 594671675 618458542 713606010 927687813 1189343350 1546146355 1784015025 1855375626 3092292710 3568030050 4118787509 4638439065 7730731775 8237575018 9276878130 12356362527 15461463550 20593937545 23192195325 24712725054 41187875090 46384390650 53544237617 61781812635 102969687725 107088475234 123563625270 160632712851 205939375450 267721188085 308909063175 321265425702 535442376170 617818126350 696075089021 803163564255 1338605940425 1392150178042 1606327128510 2088225267063 2677211880850 3480375445105 4015817821275 4176450534126 6960750890210 8031635642550 10441126335315 17401877225525 20882252670630 34803754451050 52205631676575 104411263353150