Base | Representation |
---|---|
bin | 101110101100001011… |
… | …001001110110010011 |
3 | 11210101212112201212010 |
4 | 232230023021312103 |
5 | 1310133102322311 |
6 | 35010401234003 |
7 | 3423230361051 |
oct | 565413116623 |
9 | 153355481763 |
10 | 50133245331 |
11 | 1a296a01264 |
12 | 9871632903 |
13 | 495c553710 |
14 | 25d82d71d1 |
15 | 1486414da6 |
hex | bac2c9d93 |
50133245331 has 32 divisors (see below), whose sum is σ = 73133401600. Its totient is φ = 30360489984.
The previous prime is 50133245329. The next prime is 50133245333. The reversal of 50133245331 is 13354233105.
It is an interprime number because it is at equal distance from previous prime (50133245329) and next prime (50133245333).
It is not a de Polignac number, because 50133245331 - 21 = 50133245329 is a prime.
It is a super-2 number, since 2×501332453312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50133245333) 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, 2768595 + ... + 2786643.
It is an arithmetic number, because the mean of its divisors is an integer number (2285418800).
Almost surely, 250133245331 is an apocalyptic number.
50133245331 is a deficient number, since it is larger than the sum of its proper divisors (23000156269).
50133245331 is a wasteful number, since it uses less digits than its factorization.
50133245331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19195.
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 50133245331 its reverse (13354233105), we get a palindrome (63487478436).
The spelling of 50133245331 in words is "fifty billion, one hundred thirty-three million, two hundred forty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •