Base | Representation |
---|---|
bin | 101111000010010111… |
… | …001111100010101111 |
3 | 11211100211000220021120 |
4 | 233002113033202233 |
5 | 1311413402410020 |
6 | 35111340232023 |
7 | 3435400530660 |
oct | 570227174257 |
9 | 154324026246 |
10 | 50505513135 |
11 | 1a468055600 |
12 | 995623b613 |
13 | 49bb70531c |
14 | 263191d367 |
15 | 14a8e4b740 |
hex | bc25cf8af |
50505513135 has 48 divisors (see below), whose sum is σ = 101511932928. Its totient is φ = 20989298880.
The previous prime is 50505513073. The next prime is 50505513137. The reversal of 50505513135 is 53131550505.
It is not a de Polignac number, because 50505513135 - 29 = 50505512623 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 50505513096 and 50505513105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50505513137) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1974919 + ... + 2000328.
It is an arithmetic number, because the mean of its divisors is an integer number (2114831936).
Almost surely, 250505513135 is an apocalyptic number.
50505513135 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50505513135 is an abundant number, since it is smaller than the sum of its proper divisors (51006419793).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50505513135 is a wasteful number, since it uses less digits than its factorization.
50505513135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3975284 (or 3975273 counting only the distinct ones).
The product of its (nonzero) digits is 28125, while the sum is 33.
The spelling of 50505513135 in words is "fifty billion, five hundred five million, five hundred thirteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •