Base | Representation |
---|---|
bin | 101111000100101110… |
… | …110011000000101001 |
3 | 11211110120210100020200 |
4 | 233010232303000221 |
5 | 1312004040222103 |
6 | 35115315542413 |
7 | 3436362320010 |
oct | 570456630051 |
9 | 154416710220 |
10 | 50545242153 |
11 | 1a4885205aa |
12 | 99675baa09 |
13 | 49c6a05713 |
14 | 2636d01a77 |
15 | 14ac6980a3 |
hex | bc4bb3029 |
50545242153 has 48 divisors (see below), whose sum is σ = 84068524800. Its totient is φ = 28665705600.
The previous prime is 50545242151. The next prime is 50545242161. The reversal of 50545242153 is 35124254505.
50545242153 is a `hidden beast` number, since 50 + 5 + 452 + 4 + 2 + 153 = 666.
It is not a de Polignac number, because 50545242153 - 21 = 50545242151 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50545242151) 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 in 47 ways as a sum of consecutive naturals, for example, 16256163 + ... + 16259271.
It is an arithmetic number, because the mean of its divisors is an integer number (1751427600).
Almost surely, 250545242153 is an apocalyptic number.
It is an amenable number.
50545242153 is a deficient number, since it is larger than the sum of its proper divisors (33523282647).
50545242153 is a wasteful number, since it uses less digits than its factorization.
50545242153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4982 (or 4979 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 36.
Adding to 50545242153 its reverse (35124254505), we get a palindrome (85669496658).
The spelling of 50545242153 in words is "fifty billion, five hundred forty-five million, two hundred forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •