Base | Representation |
---|---|
bin | 101111000100101111… |
… | …100110011000011001 |
3 | 11211110121012000212212 |
4 | 233010233212120121 |
5 | 1312004113440234 |
6 | 35115324244505 |
7 | 3436364154323 |
oct | 570457463031 |
9 | 154417160785 |
10 | 50545452569 |
11 | 1a4886546a7 |
12 | 99676a0735 |
13 | 49c6a7a421 |
14 | 2636d58613 |
15 | 14ac6da5ce |
hex | bc4be6619 |
50545452569 has 2 divisors, whose sum is σ = 50545452570. Its totient is φ = 50545452568.
The previous prime is 50545452493. The next prime is 50545452571. The reversal of 50545452569 is 96525454505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46295977225 + 4249475344 = 215165^2 + 65188^2 .
It is a cyclic number.
It is not a de Polignac number, because 50545452569 - 220 = 50544403993 is a prime.
It is a super-2 number, since 2×505454525692 (a number of 22 digits) contains 22 as substring.
Together with 50545452571, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (50545457569) 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 as a sum of consecutive naturals, namely, 25272726284 + 25272726285.
It is an arithmetic number, because the mean of its divisors is an integer number (25272726285).
Almost surely, 250545452569 is an apocalyptic number.
It is an amenable number.
50545452569 is a deficient number, since it is larger than the sum of its proper divisors (1).
50545452569 is an equidigital number, since it uses as much as digits as its factorization.
50545452569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400000, while the sum is 50.
The spelling of 50545452569 in words is "fifty billion, five hundred forty-five million, four hundred fifty-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •