Base | Representation |
---|---|
bin | 101111000101010111… |
… | …111011010101000101 |
3 | 11211111100002010100021 |
4 | 233011113323111011 |
5 | 1312014320233013 |
6 | 35120343015141 |
7 | 3436553054236 |
oct | 570527732505 |
9 | 154440063307 |
10 | 50556024133 |
11 | 1a49361522a |
12 | 996b13a4b1 |
13 | 49c900c1a4 |
14 | 263850b08d |
15 | 14ad5c7a8d |
hex | bc55fb545 |
50556024133 has 4 divisors (see below), whose sum is σ = 52299335340. Its totient is φ = 48812712928.
The previous prime is 50556024109. The next prime is 50556024143. The reversal of 50556024133 is 33142065505.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12927007809 + 37629016324 = 113697^2 + 193982^2 .
It is a cyclic number.
It is not a de Polignac number, because 50556024133 - 29 = 50556023621 is a prime.
It is a super-2 number, since 2×505560241332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50556024143) 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, 871655560 + ... + 871655617.
It is an arithmetic number, because the mean of its divisors is an integer number (13074833835).
Almost surely, 250556024133 is an apocalyptic number.
It is an amenable number.
50556024133 is a deficient number, since it is larger than the sum of its proper divisors (1743311207).
50556024133 is a wasteful number, since it uses less digits than its factorization.
50556024133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1743311206.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 50556024133 its reverse (33142065505), we get a palindrome (83698089638).
The spelling of 50556024133 in words is "fifty billion, five hundred fifty-six million, twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •