Base | Representation |
---|---|
bin | 101111000001001100… |
… | …000111100101100111 |
3 | 11211022102222101000222 |
4 | 233001030013211213 |
5 | 1311343332213001 |
6 | 35105354154555 |
7 | 3435041246603 |
oct | 570114074547 |
9 | 154272871028 |
10 | 50485819751 |
11 | 1a457a24684 |
12 | 994b722a5b |
13 | 49b75cb633 |
14 | 262d074503 |
15 | 14a735b61b |
hex | bc1307967 |
50485819751 has 4 divisors (see below), whose sum is σ = 53455573872. Its totient is φ = 47516065632.
The previous prime is 50485819739. The next prime is 50485819753. The reversal of 50485819751 is 15791858405.
50485819751 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15791858405 = 5 ⋅3158371681.
It is a cyclic number.
It is not a de Polignac number, because 50485819751 - 218 = 50485557607 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50485819693 and 50485819702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50485819753) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1484877035 + ... + 1484877068.
It is an arithmetic number, because the mean of its divisors is an integer number (13363893468).
Almost surely, 250485819751 is an apocalyptic number.
50485819751 is a deficient number, since it is larger than the sum of its proper divisors (2969754121).
50485819751 is a wasteful number, since it uses less digits than its factorization.
50485819751 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2969754120.
The product of its (nonzero) digits is 2016000, while the sum is 53.
The spelling of 50485819751 in words is "fifty billion, four hundred eighty-five million, eight hundred nineteen thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •