Base | Representation |
---|---|
bin | 10110110000101110000110… |
… | …10011011100100010100111 |
3 | 20120012222022220122221200201 |
4 | 23120113003103130202213 |
5 | 23030030040310230142 |
6 | 254241452021251331 |
7 | 13354114236652306 |
oct | 1330270323344247 |
9 | 216188286587621 |
10 | 50052530555047 |
11 | 14a481826a4649 |
12 | 5744623263b47 |
13 | 21c0c1982c947 |
14 | c507ac06043d |
15 | 5bbeab768ab7 |
hex | 2d85c34dc8a7 |
50052530555047 has 2 divisors, whose sum is σ = 50052530555048. Its totient is φ = 50052530555046.
The previous prime is 50052530555003. The next prime is 50052530555057. The reversal of 50052530555047 is 74055503525005.
50052530555047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 50052530555047 - 239 = 49502774741159 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50052530554988 and 50052530555006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50052530555057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25026265277523 + 25026265277524.
It is an arithmetic number, because the mean of its divisors is an integer number (25026265277524).
Almost surely, 250052530555047 is an apocalyptic number.
50052530555047 is a deficient number, since it is larger than the sum of its proper divisors (1).
50052530555047 is an equidigital number, since it uses as much as digits as its factorization.
50052530555047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2625000, while the sum is 46.
The spelling of 50052530555047 in words is "fifty trillion, fifty-two billion, five hundred thirty million, five hundred fifty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •