Base | Representation |
---|---|
bin | 1100101110111010000100… |
… | …01101001010101000011111 |
3 | 10200010202220022122110212201 |
4 | 12113131002031022220133 |
5 | 12132223001123102203 |
6 | 135315005032512331 |
7 | 5616635110512340 |
oct | 627350215125037 |
9 | 120122808573781 |
10 | 28000002550303 |
11 | 8a15809532363 |
12 | 318270824b6a7 |
13 | 128150958b944 |
14 | 6cb2c8da20c7 |
15 | 338527151e1d |
hex | 19774234aa1f |
28000002550303 has 8 divisors (see below), whose sum is σ = 32007663949472. Its totient is φ = 23994256409856.
The previous prime is 28000002550297. The next prime is 28000002550321. The reversal of 28000002550303 is 30305520000082.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 28000002550303 - 217 = 28000002419231 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 (28000002550343) 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, 478783350 + ... + 478841827.
It is an arithmetic number, because the mean of its divisors is an integer number (4000957993684).
Almost surely, 228000002550303 is an apocalyptic number.
28000002550303 is a deficient number, since it is larger than the sum of its proper divisors (4007661399169).
28000002550303 is an equidigital number, since it uses as much as digits as its factorization.
28000002550303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957629361.
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 28000002550303 its reverse (30305520000082), we get a palindrome (58305522550385).
The spelling of 28000002550303 in words is "twenty-eight trillion, two million, five hundred fifty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •