Base | Representation |
---|---|
bin | 101111000010001101… |
… | …101111001010010011 |
3 | 11211100122100021222210 |
4 | 233002031233022103 |
5 | 1311412233134303 |
6 | 35111211003203 |
7 | 3435340411605 |
oct | 570215571223 |
9 | 154318307883 |
10 | 50503021203 |
11 | 1a466703358 |
12 | 9955439503 |
13 | 49bb041ccb |
14 | 2631471175 |
15 | 14a8b08203 |
hex | bc236f293 |
50503021203 has 8 divisors (see below), whose sum is σ = 69157290448. Its totient is φ = 32758716384.
The previous prime is 50503021159. The next prime is 50503021211. The reversal of 50503021203 is 30212030505.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50503021203 - 26 = 50503021139 is a prime.
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 50503021203.
It is not an unprimeable number, because it can be changed into a prime (50503021243) 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 7 ways as a sum of consecutive naturals, for example, 227490976 + ... + 227491197.
It is an arithmetic number, because the mean of its divisors is an integer number (8644661306).
Almost surely, 250503021203 is an apocalyptic number.
50503021203 is a deficient number, since it is larger than the sum of its proper divisors (18654269245).
50503021203 is a wasteful number, since it uses less digits than its factorization.
50503021203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454982213.
The product of its (nonzero) digits is 900, while the sum is 21.
Adding to 50503021203 its reverse (30212030505), we get a palindrome (80715051708).
It can be divided in two parts, 5050302 and 1203, that added together give a palindrome (5051505).
The spelling of 50503021203 in words is "fifty billion, five hundred three million, twenty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •