Base | Representation |
---|---|
bin | 100101001000010010110… |
… | …0000110011001101100111 |
3 | 200001211212100211002010001 |
4 | 1022100211200303031213 |
5 | 1132102021412044030 |
6 | 14504150430242131 |
7 | 1034453230404343 |
oct | 112204540631547 |
9 | 20054770732101 |
10 | 5103050503015 |
11 | 1698211a77733 |
12 | 6a5009356347 |
13 | 2b02a588b57a |
14 | 138dbb9d8623 |
15 | 8cb1e678cca |
hex | 4a425833367 |
5103050503015 has 64 divisors (see below), whose sum is σ = 6438054534912. Its totient is φ = 3879287193600.
The previous prime is 5103050503009. The next prime is 5103050503049.
5103050503015 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5103050503015 - 25 = 5103050502983 is a prime.
It is a super-2 number, since 2×51030505030152 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 882419814 + ... + 882425596.
It is an arithmetic number, because the mean of its divisors is an integer number (100594602108).
Almost surely, 25103050503015 is an apocalyptic number.
5103050503015 is a deficient number, since it is larger than the sum of its proper divisors (1335004031897).
5103050503015 is a wasteful number, since it uses less digits than its factorization.
5103050503015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6460.
The product of its (nonzero) digits is 5625, while the sum is 28.
It can be divided in two parts, 5103050 and 503015, that added together give a palindrome (5606065).
The spelling of 5103050503015 in words is "five trillion, one hundred three billion, fifty million, five hundred three thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •