Base | Representation |
---|---|
bin | 10110111111001101010001… |
… | …11111001110111010010001 |
3 | 20121222120011200120201020002 |
4 | 23133212220333032322101 |
5 | 23111204011121130212 |
6 | 255302253432455345 |
7 | 13435065455050616 |
oct | 1337465077167221 |
9 | 217876150521202 |
10 | 50550305255057 |
11 | 1511a29a522243 |
12 | 5804ba2b4a555 |
13 | 2228b4792b45a |
14 | c6a90d8dc50d |
15 | 5c9de1d33ac2 |
hex | 2df9a8fcee91 |
50550305255057 has 4 divisors (see below), whose sum is σ = 50552829887040. Its totient is φ = 50547780623076.
The previous prime is 50550305254993. The next prime is 50550305255059. The reversal of 50550305255057 is 75055250305505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50550305255057 - 26 = 50550305254993 is a prime.
It is a super-2 number, since 2×505503052550572 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50550305255059) 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, 1262285957 + ... + 1262326002.
It is an arithmetic number, because the mean of its divisors is an integer number (12638207471760).
Almost surely, 250550305255057 is an apocalyptic number.
It is an amenable number.
50550305255057 is a deficient number, since it is larger than the sum of its proper divisors (2524631983).
50550305255057 is a wasteful number, since it uses less digits than its factorization.
50550305255057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2524631982.
The product of its (nonzero) digits is 3281250, while the sum is 47.
The spelling of 50550305255057 in words is "fifty trillion, five hundred fifty billion, three hundred five million, two hundred fifty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •