Base | Representation |
---|---|
bin | 101111000111110000… |
… | …010000101011011101 |
3 | 11211121010012221120201 |
4 | 233013300100223131 |
5 | 1312110031114334 |
6 | 35124330543501 |
7 | 3440546354041 |
oct | 570760205335 |
9 | 154533187521 |
10 | 50595957469 |
11 | 1a50410a792 |
12 | 9980597b91 |
13 | 4a04381595 |
14 | 263d944021 |
15 | 14b1d64c14 |
hex | bc7c10add |
50595957469 has 2 divisors, whose sum is σ = 50595957470. Its totient is φ = 50595957468.
The previous prime is 50595957457. The next prime is 50595957479. The reversal of 50595957469 is 96475959505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49134042244 + 1461915225 = 221662^2 + 38235^2 .
It is a cyclic number.
It is not a de Polignac number, because 50595957469 - 229 = 50059086557 is a prime.
It is a super-2 number, since 2×505959574692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50595957469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50595957479) 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, 25297978734 + 25297978735.
It is an arithmetic number, because the mean of its divisors is an integer number (25297978735).
Almost surely, 250595957469 is an apocalyptic number.
It is an amenable number.
50595957469 is a deficient number, since it is larger than the sum of its proper divisors (1).
50595957469 is an equidigital number, since it uses as much as digits as its factorization.
50595957469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76545000, while the sum is 64.
The spelling of 50595957469 in words is "fifty billion, five hundred ninety-five million, nine hundred fifty-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •