Base | Representation |
---|---|
bin | 101110100100110111… |
… | …001001101000011011 |
3 | 11210002022200201122220 |
4 | 232210313021220123 |
5 | 1304410200423201 |
6 | 34550255515123 |
7 | 3420210516663 |
oct | 564467115033 |
9 | 153068621586 |
10 | 50010561051 |
11 | 1a2337267a0 |
12 | 9838528aa3 |
13 | 493ccc9a79 |
14 | 25c5cbd1a3 |
15 | 147a77e036 |
hex | ba4dc9a1b |
50010561051 has 32 divisors (see below), whose sum is σ = 73434332160. Its totient is φ = 30022231200.
The previous prime is 50010560947. The next prime is 50010561059. The reversal of 50010561051 is 15016501005.
It is not a de Polignac number, because 50010561051 - 27 = 50010560923 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50010561059) 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 31 ways as a sum of consecutive naturals, for example, 2019736 + ... + 2044346.
It is an arithmetic number, because the mean of its divisors is an integer number (2294822880).
Almost surely, 250010561051 is an apocalyptic number.
50010561051 is a deficient number, since it is larger than the sum of its proper divisors (23423771109).
50010561051 is a wasteful number, since it uses less digits than its factorization.
50010561051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25207.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 50010561051 in words is "fifty billion, ten million, five hundred sixty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •