Base | Representation |
---|---|
bin | 101110100111001111… |
… | …101101110010101011 |
3 | 11210012002221122010011 |
4 | 232213033231302223 |
5 | 1310000420230201 |
6 | 34554245032351 |
7 | 3421204461400 |
oct | 564717556253 |
9 | 153162848104 |
10 | 50050555051 |
11 | 1a254262892 |
12 | 98499b56b7 |
13 | 4948390963 |
14 | 25cb3302a7 |
15 | 147e02e151 |
hex | ba73edcab |
50050555051 has 12 divisors (see below), whose sum is σ = 58420801152. Its totient is φ = 42754045488.
The previous prime is 50050555033. The next prime is 50050555097. The reversal of 50050555051 is 15055505005.
It is a de Polignac number, because none of the positive numbers 2k-50050555051 is a prime.
It is a super-2 number, since 2×500505550512 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50050555031) 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 11 ways as a sum of consecutive naturals, for example, 1728715 + ... + 1757428.
It is an arithmetic number, because the mean of its divisors is an integer number (4868400096).
Almost surely, 250050555051 is an apocalyptic number.
50050555051 is a deficient number, since it is larger than the sum of its proper divisors (8370246101).
50050555051 is a wasteful number, since it uses less digits than its factorization.
50050555051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3486450 (or 3486443 counting only the distinct ones).
The product of its (nonzero) digits is 15625, while the sum is 31.
The spelling of 50050555051 in words is "fifty billion, fifty million, five hundred fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •