Base | Representation |
---|---|
bin | 101110111100001101… |
… | …011000111111110011 |
3 | 11211002121202110101012 |
4 | 232330031120333303 |
5 | 1311210440021443 |
6 | 35053211301135 |
7 | 3433005126125 |
oct | 567415307763 |
9 | 154077673335 |
10 | 50402267123 |
11 | 1a41484731a |
12 | 992774a7ab |
13 | 49a31c6200 |
14 | 2621d25215 |
15 | 149ed55118 |
hex | bbc358ff3 |
50402267123 has 12 divisors (see below), whose sum is σ = 54592928928. Its totient is φ = 46512105120.
The previous prime is 50402267117. The next prime is 50402267171. The reversal of 50402267123 is 32176220405.
It is not a de Polignac number, because 50402267123 - 28 = 50402266867 is a prime.
It is a super-2 number, since 2×504022671232 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50402267123.
It is not an unprimeable number, because it can be changed into a prime (50402260123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 589853 + ... + 669873.
It is an arithmetic number, because the mean of its divisors is an integer number (4549410744).
Almost surely, 250402267123 is an apocalyptic number.
50402267123 is a deficient number, since it is larger than the sum of its proper divisors (4190661805).
50402267123 is a wasteful number, since it uses less digits than its factorization.
50402267123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83774 (or 83761 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 50402267123 its reverse (32176220405), we get a palindrome (82578487528).
The spelling of 50402267123 in words is "fifty billion, four hundred two million, two hundred sixty-seven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •