Base | Representation |
---|---|
bin | 100101011110011000111… |
… | …0101111101000010011111 |
3 | 200020101100100012122120220 |
4 | 1022330301311331002133 |
5 | 1133341212003441020 |
6 | 14542035153012423 |
7 | 1041053145532311 |
oct | 112746165750237 |
9 | 20211310178526 |
10 | 5150502015135 |
11 | 1706352129054 |
12 | 6b2250854113 |
13 | 2b48c8652aa9 |
14 | 13b3dda957b1 |
15 | 8de9a416240 |
hex | 4af31d7d09f |
5150502015135 has 16 divisors (see below), whose sum is σ = 8363800288896. Its totient is φ = 2705935386528.
The previous prime is 5150502015121. The next prime is 5150502015161. The reversal of 5150502015135 is 5315102050515.
It is not a de Polignac number, because 5150502015135 - 27 = 5150502015007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5150502015096 and 5150502015105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2562437809 + ... + 2562439818.
It is an arithmetic number, because the mean of its divisors is an integer number (522737518056).
Almost surely, 25150502015135 is an apocalyptic number.
5150502015135 is a deficient number, since it is larger than the sum of its proper divisors (3213298273761).
5150502015135 is a wasteful number, since it uses less digits than its factorization.
5150502015135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5124877702.
The product of its (nonzero) digits is 18750, while the sum is 33.
The spelling of 5150502015135 in words is "five trillion, one hundred fifty billion, five hundred two million, fifteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •