Base | Representation |
---|---|
bin | 101110100111010001… |
… | …111101111100111100 |
3 | 11210012011001122002211 |
4 | 232213101331330330 |
5 | 1310001043124112 |
6 | 34554305430204 |
7 | 3421212501043 |
oct | 564721757474 |
9 | 153164048084 |
10 | 50051145532 |
11 | 1a254626493 |
12 | 984a03b364 |
13 | 494853965b |
14 | 25cb44555a |
15 | 147e0e90a7 |
hex | ba747df3c |
50051145532 has 6 divisors (see below), whose sum is σ = 87589504688. Its totient is φ = 25025572764.
The previous prime is 50051145517. The next prime is 50051145587. The reversal of 50051145532 is 23554115005.
It is a junction number, because it is equal to n+sod(n) for n = 50051145494 and 50051145503.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 6256393188 + ... + 6256393195.
Almost surely, 250051145532 is an apocalyptic number.
It is an amenable number.
50051145532 is a deficient number, since it is larger than the sum of its proper divisors (37538359156).
50051145532 is a wasteful number, since it uses less digits than its factorization.
50051145532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12512786387 (or 12512786385 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 31.
The spelling of 50051145532 in words is "fifty billion, fifty-one million, one hundred forty-five thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •