Search a number
-
+
51006051106050 = 23527310214562279
BaseRepresentation
bin10111001100011110001011…
…00011101011110100000010
320200121010112101210201121210
423212033011203223310002
523141140343040343200
6300251504552030550
713513031331630555
oct1346170543536402
9220533471721553
1051006051106050
11152855aa140577
125879393392456
13225cb0853c231
14c849c556469c
155d6bb7756650
hex2e63c58ebd02

51006051106050 has 96 divisors (see below), whose sum is σ = 128353433604480. Its totient is φ = 13402147852800.

The previous prime is 51006051105983. The next prime is 51006051106051. The reversal of 51006051106050 is 5060115060015.

51006051106050 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 (30).

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

It is not an unprimeable number, because it can be changed into a prime (51006051106051) 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 47 ways as a sum of consecutive naturals, for example, 8898811 + ... + 13461089.

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

Almost surely, 251006051106050 is an apocalyptic number.

51006051106050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 51006051106050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64176716802240).

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

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

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 30.

Adding to 51006051106050 its reverse (5060115060015), we get a palindrome (56066166166065).

The spelling of 51006051106050 in words is "fifty-one trillion, six billion, fifty-one million, one hundred six thousand, fifty".

Divisors: 1 2 3 5 6 10 15 25 30 50 73 75 146 150 219 365 438 730 1021 1095 1825 2042 2190 3063 3650 5105 5475 6126 10210 10950 15315 25525 30630 51050 74533 76575 149066 153150 223599 372665 447198 745330 1117995 1863325 2235990 3726650 4562279 5589975 9124558 11179950 13686837 22811395 27373674 45622790 68434185 114056975 136868370 228113950 333046367 342170925 666092734 684341850 999139101 1665231835 1998278202 3330463670 4658086859 4995695505 8326159175 9316173718 9991391010 13974260577 16652318350 23290434295 24978477525 27948521154 46580868590 49956955050 69871302885 116452171475 139742605770 232904342950 340040340707 349356514425 680080681414 698713028850 1020121022121 1700201703535 2040242044242 3400403407070 5100605110605 8501008517675 10201210221210 17002017035350 25503025553025 51006051106050