Base | Representation |
---|---|
bin | 101110111100010111… |
… | …111100000101101111 |
3 | 11211002210221221111021 |
4 | 232330113330011233 |
5 | 1311212142013203 |
6 | 35053350435011 |
7 | 3433040463643 |
oct | 567427740557 |
9 | 154083857437 |
10 | 50405032303 |
11 | 1a41636589a |
12 | 9928662a67 |
13 | 49a3953a02 |
14 | 2622444c23 |
15 | 14a01ee5bd |
hex | bbc5fc16f |
50405032303 has 4 divisors (see below), whose sum is σ = 53057928760. Its totient is φ = 47752135848.
The previous prime is 50405032267. The next prime is 50405032331. The reversal of 50405032303 is 30323050405.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30323050405 = 5 ⋅6064610081.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50405032303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50405032333) 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 3 ways as a sum of consecutive naturals, for example, 1326448200 + ... + 1326448237.
It is an arithmetic number, because the mean of its divisors is an integer number (13264482190).
Almost surely, 250405032303 is an apocalyptic number.
50405032303 is a deficient number, since it is larger than the sum of its proper divisors (2652896457).
50405032303 is a wasteful number, since it uses less digits than its factorization.
50405032303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2652896456.
The product of its (nonzero) digits is 5400, while the sum is 25.
Adding to 50405032303 its reverse (30323050405), we get a palindrome (80728082708).
The spelling of 50405032303 in words is "fifty billion, four hundred five million, thirty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •