Base | Representation |
---|---|
bin | 101110110001100110… |
… | …100011010010100111 |
3 | 11210122012220110220200 |
4 | 232301212203102213 |
5 | 1310324411013021 |
6 | 35023413201543 |
7 | 3425414423001 |
oct | 566146432247 |
9 | 153565813820 |
10 | 50224313511 |
11 | 1a333352119 |
12 | 98980302b3 |
13 | 497538a908 |
14 | 2606441371 |
15 | 148e403126 |
hex | bb19a34a7 |
50224313511 has 48 divisors (see below), whose sum is σ = 77333667840. Its totient is φ = 31300496640.
The previous prime is 50224313501. The next prime is 50224313519. The reversal of 50224313511 is 11531342205.
50224313511 is a `hidden beast` number, since 502 + 24 + 3 + 135 + 1 + 1 = 666.
It is not a de Polignac number, because 50224313511 - 213 = 50224305319 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50224313519) 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 47 ways as a sum of consecutive naturals, for example, 38076910 + ... + 38078228.
It is an arithmetic number, because the mean of its divisors is an integer number (1611118080).
Almost surely, 250224313511 is an apocalyptic number.
50224313511 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
50224313511 is a deficient number, since it is larger than the sum of its proper divisors (27109354329).
50224313511 is a wasteful number, since it uses less digits than its factorization.
50224313511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2836 (or 2833 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 50224313511 its reverse (11531342205), we get a palindrome (61755655716).
The spelling of 50224313511 in words is "fifty billion, two hundred twenty-four million, three hundred thirteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •