Base | Representation |
---|---|
bin | 100110100101101000101… |
… | …1011101000011110101101 |
3 | 200210000021021011111201211 |
4 | 1031023101123220132231 |
5 | 1143343033322400401 |
6 | 15140221254034421 |
7 | 1055110520313352 |
oct | 115132133503655 |
9 | 20700237144654 |
10 | 5303503325101 |
11 | 1765226401863 |
12 | 717a30648a11 |
13 | 2c616c954ab7 |
14 | 144995cb0629 |
15 | 92e52747951 |
hex | 4d2d16e87ad |
5303503325101 has 6 divisors (see below), whose sum is σ = 5379252633806. Its totient is φ = 5228806090200.
The previous prime is 5303503325063. The next prime is 5303503325119. The reversal of 5303503325101 is 1015233053035.
It can be written as a sum of positive squares in only one way, i.e., 3081692475625 + 2221810849476 = 1755475^2 + 1490574^2 .
It is not a de Polignac number, because 5303503325101 - 229 = 5302966454189 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 (5303503325191) 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 5 ways as a sum of consecutive naturals, for example, 526031790 + ... + 526041871.
Almost surely, 25303503325101 is an apocalyptic number.
It is an amenable number.
5303503325101 is a deficient number, since it is larger than the sum of its proper divisors (75749308705).
5303503325101 is an equidigital number, since it uses as much as digits as its factorization.
5303503325101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1052073803 (or 1052073732 counting only the distinct ones).
The product of its (nonzero) digits is 20250, while the sum is 31.
Adding to 5303503325101 its reverse (1015233053035), we get a palindrome (6318736378136).
The spelling of 5303503325101 in words is "five trillion, three hundred three billion, five hundred three million, three hundred twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •