Base | Representation |
---|---|
bin | 101111000101010100… |
… | …001000111011011101 |
3 | 11211111021012200101020 |
4 | 233011110020323131 |
5 | 1312014042000021 |
6 | 35120305434353 |
7 | 3436541450460 |
oct | 570524107335 |
9 | 154437180336 |
10 | 50555031261 |
11 | 1a492aa7279 |
12 | 996a93b9b9 |
13 | 49c8a522a7 |
14 | 263832d2d7 |
15 | 14ad47d7c6 |
hex | bc5508edd |
50555031261 has 32 divisors (see below), whose sum is σ = 82816143360. Its totient is φ = 26785826496.
The previous prime is 50555031253. The next prime is 50555031269. The reversal of 50555031261 is 16213055505.
It is an interprime number because it is at equal distance from previous prime (50555031253) and next prime (50555031269).
It is not a de Polignac number, because 50555031261 - 23 = 50555031253 is a prime.
It is a super-2 number, since 2×505550312612 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50555031269) 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 in 31 ways as a sum of consecutive naturals, for example, 1329166 + ... + 1366671.
It is an arithmetic number, because the mean of its divisors is an integer number (2588004480).
Almost surely, 250555031261 is an apocalyptic number.
It is an amenable number.
50555031261 is a deficient number, since it is larger than the sum of its proper divisors (32261112099).
50555031261 is a wasteful number, since it uses less digits than its factorization.
50555031261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2695913.
The product of its (nonzero) digits is 22500, while the sum is 33.
Adding to 50555031261 its reverse (16213055505), we get a palindrome (66768086766).
The spelling of 50555031261 in words is "fifty billion, five hundred fifty-five million, thirty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •