Base | Representation |
---|---|
bin | 101111000101000100… |
… | …011011110001100001 |
3 | 11211110222110111202110 |
4 | 233011010123301201 |
5 | 1312012013223040 |
6 | 35120041305533 |
7 | 3436461452304 |
oct | 570504336141 |
9 | 154428414673 |
10 | 50550914145 |
11 | 1a490744aa6 |
12 | 99694952a9 |
13 | 49c7c40324 |
14 | 263797ab3b |
15 | 14ace18980 |
hex | bc511bc61 |
50550914145 has 64 divisors (see below), whose sum is σ = 87362426880. Its totient is φ = 24866688000.
The previous prime is 50550914123. The next prime is 50550914177. The reversal of 50550914145 is 54141905505.
It is not a de Polignac number, because 50550914145 - 212 = 50550910049 is a prime.
It is a super-2 number, since 2×505509141452 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4974820 + ... + 4984970.
It is an arithmetic number, because the mean of its divisors is an integer number (1365037920).
Almost surely, 250550914145 is an apocalyptic number.
It is an amenable number.
50550914145 is a deficient number, since it is larger than the sum of its proper divisors (36811512735).
50550914145 is a wasteful number, since it uses less digits than its factorization.
50550914145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10566.
The product of its (nonzero) digits is 90000, while the sum is 39.
The spelling of 50550914145 in words is "fifty billion, five hundred fifty million, nine hundred fourteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •