Base | Representation |
---|---|
bin | 101110110010100111… |
… | …100001011010001101 |
3 | 11210200101221202221200 |
4 | 232302213201122031 |
5 | 1310343241021130 |
6 | 35025222220113 |
7 | 3426012246654 |
oct | 566247413215 |
9 | 153611852850 |
10 | 50241345165 |
11 | 1a341a25270 |
12 | 98a1884639 |
13 | 4978a71c0b |
14 | 26087d619b |
15 | 1490b69760 |
hex | bb29e168d |
50241345165 has 192 divisors, whose sum is σ = 102682494720. Its totient is φ = 22532567040.
The previous prime is 50241345163. The next prime is 50241345169. The reversal of 50241345165 is 56154314205.
50241345165 is a `hidden beast` number, since 5 + 0 + 2 + 4 + 134 + 516 + 5 = 666.
It is not a de Polignac number, because 50241345165 - 21 = 50241345163 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50241345163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 177531114 + ... + 177531396.
It is an arithmetic number, because the mean of its divisors is an integer number (534804660).
Almost surely, 250241345165 is an apocalyptic number.
50241345165 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50241345165 is an abundant number, since it is smaller than the sum of its proper divisors (52441149555).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50241345165 is a wasteful number, since it uses less digits than its factorization.
50241345165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429 (or 392 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 50241345165 in words is "fifty billion, two hundred forty-one million, three hundred forty-five thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •