Search a number
-
+
11501105515050 = 2352536791213029
BaseRepresentation
bin1010011101011100111101…
…0011110000101000101010
31111201111100211002101002210
42213113033103300220222
53001413231002440200
640243311313505550
72264633054605644
oct247271723605052
944644324071083
1011501105515050
113734656259208
121358ba8b722b6
1365571b603b38
142ba929531894
1514e2843b2650
hexa75cf4f0a2a

11501105515050 has 96 divisors (see below), whose sum is σ = 29065322378880. Its totient is φ = 3008637049600.

The previous prime is 11501105515049. The next prime is 11501105515051. The reversal of 11501105515050 is 5051550110511.

It is a happy number.

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

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

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (11501105515051) 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, 53881936 + ... + 54094964.

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

Almost surely, 211501105515050 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 11501105515050 its reverse (5051550110511), we get a palindrome (16552655625561).

The spelling of 11501105515050 in words is "eleven trillion, five hundred one billion, one hundred five million, five hundred fifteen thousand, fifty".

Divisors: 1 2 3 5 6 10 15 25 30 50 53 75 106 150 159 265 318 530 795 1325 1590 2650 3975 6791 7950 13582 20373 33955 40746 67910 101865 169775 203730 213029 339550 359923 426058 509325 639087 719846 1018650 1065145 1079769 1278174 1799615 2130290 2159538 3195435 3599230 5325725 5398845 6390870 8998075 10651450 10797690 11290537 15977175 17996150 22581074 26994225 31954350 33871611 53988450 56452685 67743222 112905370 169358055 282263425 338716110 564526850 846790275 1446679939 1693580550 2893359878 4340039817 7233399695 8680079634 14466799390 21700199085 36166998475 43400398170 72333996950 76674036767 108500995425 153348073534 217001990850 230022110301 383370183835 460044220602 766740367670 1150110551505 1916850919175 2300221103010 3833701838350 5750552757525 11501105515050