Base | Representation |
---|---|
bin | 100101000101000101001… |
… | …1001011100101000100101 |
3 | 200001012001200012201110022 |
4 | 1022022022121130220211 |
5 | 1131443410200432444 |
6 | 14501050200004525 |
7 | 1034120265651500 |
oct | 112121231345045 |
9 | 20035050181408 |
10 | 5096153139749 |
11 | 16952a2655611 |
12 | 6a3803460745 |
13 | 2ac746910329 |
14 | 138925958137 |
15 | 8c868d859ee |
hex | 4a28a65ca25 |
5096153139749 has 6 divisors (see below), whose sum is σ = 5928178142214. Its totient is φ = 4368131262600.
The previous prime is 5096153139709. The next prime is 5096153139767. The reversal of 5096153139749 is 9479313516905.
It can be written as a sum of positive squares in only one way, i.e., 4604672222500 + 491480917249 = 2145850^2 + 701057^2 .
It is not a de Polignac number, because 5096153139749 - 216 = 5096153074213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5096153139691 and 5096153139700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5096153139709) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 52001562602 + ... + 52001562699.
It is an arithmetic number, because the mean of its divisors is an integer number (988029690369).
Almost surely, 25096153139749 is an apocalyptic number.
It is an amenable number.
5096153139749 is a deficient number, since it is larger than the sum of its proper divisors (832025002465).
5096153139749 is a wasteful number, since it uses less digits than its factorization.
5096153139749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104003125315 (or 104003125308 counting only the distinct ones).
The product of its (nonzero) digits is 27556200, while the sum is 62.
The spelling of 5096153139749 in words is "five trillion, ninety-six billion, one hundred fifty-three million, one hundred thirty-nine thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •