Base | Representation |
---|---|
bin | 1001110111110101… |
… | …10110011010111111 |
3 | 111200101100121112210 |
4 | 10323322312122333 |
5 | 41323331002203 |
6 | 2233534431503 |
7 | 245226245535 |
oct | 47372663277 |
9 | 14611317483 |
10 | 5300250303 |
11 | 227a942557 |
12 | 103b062593 |
13 | 6661165aa |
14 | 383cdc155 |
15 | 2104b4803 |
hex | 13beb66bf |
5300250303 has 8 divisors (see below), whose sum is σ = 7068246400. Its totient is φ = 3532877208.
The previous prime is 5300250287. The next prime is 5300250311. The reversal of 5300250303 is 3030520035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5300250303 - 24 = 5300250287 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 5300250303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5300250353) 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 7 ways as a sum of consecutive naturals, for example, 135523 + ... + 170196.
It is an arithmetic number, because the mean of its divisors is an integer number (883530800).
Almost surely, 25300250303 is an apocalyptic number.
5300250303 is a deficient number, since it is larger than the sum of its proper divisors (1767996097).
5300250303 is a wasteful number, since it uses less digits than its factorization.
5300250303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311501.
The product of its (nonzero) digits is 1350, while the sum is 21.
The square root of 5300250303 is about 72802.8179605707. The cubic root of 5300250303 is about 1743.5408477912.
Adding to 5300250303 its reverse (3030520035), we get a palindrome (8330770338).
The spelling of 5300250303 in words is "five billion, three hundred million, two hundred fifty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •