Base | Representation |
---|---|
bin | 101110101010110100… |
… | …100101000000110101 |
3 | 11210100021211200210212 |
4 | 232222310211000311 |
5 | 1310111300100234 |
6 | 35004230555205 |
7 | 3422533435106 |
oct | 565264450065 |
9 | 153307750725 |
10 | 50110550069 |
11 | 1a28510aa48 |
12 | 9865b08b05 |
13 | 4957938578 |
14 | 25d52aa3ad |
15 | 14844305ce |
hex | baad25035 |
50110550069 has 2 divisors, whose sum is σ = 50110550070. Its totient is φ = 50110550068.
The previous prime is 50110550051. The next prime is 50110550071. The reversal of 50110550069 is 96005501105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 45877356100 + 4233193969 = 214190^2 + 65063^2 .
It is a cyclic number.
It is not a de Polignac number, because 50110550069 - 28 = 50110549813 is a prime.
It is a super-2 number, since 2×501105500692 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 50110550071, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50110550669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25055275034 + 25055275035.
It is an arithmetic number, because the mean of its divisors is an integer number (25055275035).
Almost surely, 250110550069 is an apocalyptic number.
It is an amenable number.
50110550069 is a deficient number, since it is larger than the sum of its proper divisors (1).
50110550069 is an equidigital number, since it uses as much as digits as its factorization.
50110550069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6750, while the sum is 32.
The spelling of 50110550069 in words is "fifty billion, one hundred ten million, five hundred fifty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •