Base | Representation |
---|---|
bin | 101111000010110111… |
… | …101101011001110111 |
3 | 11211101102001022001211 |
4 | 233002313231121313 |
5 | 1311423042232210 |
6 | 35112242502251 |
7 | 3435533056105 |
oct | 570267553167 |
9 | 154342038054 |
10 | 50514024055 |
11 | 1a471938a20 |
12 | 9959064987 |
13 | 49c03c5181 |
14 | 2632ad6c75 |
15 | 14a9a7d38a |
hex | bc2ded677 |
50514024055 has 64 divisors (see below), whose sum is σ = 71270438400. Its totient is φ = 33981120000.
The previous prime is 50514024053. The next prime is 50514024061. The reversal of 50514024055 is 55042041505.
It is not a de Polignac number, because 50514024055 - 21 = 50514024053 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50514024053) 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 63 ways as a sum of consecutive naturals, for example, 8857705 + ... + 8863405.
It is an arithmetic number, because the mean of its divisors is an integer number (1113600600).
Almost surely, 250514024055 is an apocalyptic number.
50514024055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
50514024055 is a deficient number, since it is larger than the sum of its proper divisors (20756414345).
50514024055 is a wasteful number, since it uses less digits than its factorization.
50514024055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5936.
The product of its (nonzero) digits is 20000, while the sum is 31.
The spelling of 50514024055 in words is "fifty billion, five hundred fourteen million, twenty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •