Search a number
-
+
50335110520000 = 26542293548791
BaseRepresentation
bin10110111000111100011100…
…11000011101110011000000
320121012222201101201111202121
423130132032120131303000
523044142301243120000
6255015344110454024
713413406651015525
oct1334361630356300
9217188641644677
1050335110520000
1115047000722769
12578b346804314
1322117716304b7
14c603377c514c
155c44e9930b1a
hex2dc78e61dcc0

50335110520000 has 140 divisors (see below), whose sum is σ = 124869375646576. Its totient is φ = 20125226880000.

The previous prime is 50335110519973. The next prime is 50335110520027. The reversal of 50335110520000 is 2501153305.

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

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

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

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

It is an unprimeable number.

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 19 ways as a sum of consecutive naturals, for example, 91445605 + ... + 91994395.

Almost surely, 250335110520000 is an apocalyptic number.

50335110520000 is a gapful number since it is divisible by the number (50) 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 50335110520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62434687823288).

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

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

50335110520000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 2250, while the sum is 25.

Adding to 50335110520000 its reverse (2501153305), we get a palindrome (50337611673305).

The spelling of 50335110520000 in words is "fifty trillion, three hundred thirty-five billion, one hundred ten million, five hundred twenty thousand".

Divisors: 1 2 4 5 8 10 16 20 25 32 40 50 64 80 100 125 160 200 250 320 400 500 625 800 1000 1250 1600 2000 2293 2500 4000 4586 5000 8000 9172 10000 11465 18344 20000 22930 36688 40000 45860 57325 73376 91720 114650 146752 183440 229300 286625 366880 458600 548791 573250 733760 917200 1097582 1146500 1433125 1834400 2195164 2293000 2743955 2866250 3668800 4390328 4586000 5487910 5732500 8780656 9172000 10975820 11465000 13719775 17561312 18344000 21951640 22930000 27439550 35122624 43903280 45860000 54879100 68598875 87806560 91720000 109758200 137197750 175613120 219516400 274395500 342994375 439032800 548791000 685988750 878065600 1097582000 1258377763 1371977500 2195164000 2516755526 2743955000 4390328000 5033511052 5487910000 6291888815 10067022104 10975820000 12583777630 20134044208 21951640000 25167555260 31459444075 40268088416 50335110520 62918888150 80536176832 100670221040 125837776300 157297220375 201340442080 251675552600 314594440750 402680884160 503351105200 629188881500 786486101875 1006702210400 1258377763000 1572972203750 2013404420800 2516755526000 3145944407500 5033511052000 6291888815000 10067022104000 12583777630000 25167555260000 50335110520000