Base | Representation |
---|---|
bin | 1110100011011011010… |
… | …10011100100110000011 |
3 | 1202210201202200100110100 |
4 | 13101231222130212003 |
5 | 31143103322100201 |
6 | 1021420024333443 |
7 | 51061566202515 |
oct | 7215552344603 |
9 | 1683652610410 |
10 | 500056050051 |
11 | 183088670758 |
12 | 80ab7914283 |
13 | 38202943b9c |
14 | 1a2ba853bb5 |
15 | d01aa05886 |
hex | 746da9c983 |
500056050051 has 12 divisors (see below), whose sum is σ = 727990611712. Its totient is φ = 330745733136.
The previous prime is 500056050041. The next prime is 500056050071. The reversal of 500056050051 is 150050650005.
500056050051 is a `hidden beast` number, since 5 + 0 + 0 + 0 + 5 + 605 + 0 + 0 + 51 = 666.
It is not a de Polignac number, because 500056050051 - 27 = 500056049923 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 500056049997 and 500056050024.
It is not an unprimeable number, because it can be changed into a prime (500056050031) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 218746036 + ... + 218748321.
Almost surely, 2500056050051 is an apocalyptic number.
500056050051 is a deficient number, since it is larger than the sum of its proper divisors (227934561661).
500056050051 is a wasteful number, since it uses less digits than its factorization.
500056050051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 437494490 (or 437494487 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 500056050051 in words is "five hundred billion, fifty-six million, fifty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •