Base | Representation |
---|---|
bin | 100101001011101001011… |
… | …1101011011100110011111 |
3 | 200002112110111011111120002 |
4 | 1022113102331123212133 |
5 | 1132211300342343033 |
6 | 14511341405044515 |
7 | 1035126615326426 |
oct | 112272275334637 |
9 | 20075414144502 |
10 | 5110255434143 |
11 | 16a0279a72072 |
12 | 6a649a25673b |
13 | 2b0b83487122 |
14 | 1394a285c2bd |
15 | 8cde1e733e8 |
hex | 4a5d2f5b99f |
5110255434143 has 4 divisors (see below), whose sum is σ = 5110387292640. Its totient is φ = 5110123575648.
The previous prime is 5110255434131. The next prime is 5110255434149. The reversal of 5110255434143 is 3414345520115.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5110255434143 - 28 = 5110255433887 is a prime.
It is a super-2 number, since 2×51102554341432 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5110255434097 and 5110255434106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110255434149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65871098 + ... + 65948631.
It is an arithmetic number, because the mean of its divisors is an integer number (1277596823160).
Almost surely, 25110255434143 is an apocalyptic number.
5110255434143 is a deficient number, since it is larger than the sum of its proper divisors (131858497).
5110255434143 is a wasteful number, since it uses less digits than its factorization.
5110255434143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131858496.
The product of its (nonzero) digits is 144000, while the sum is 38.
The spelling of 5110255434143 in words is "five trillion, one hundred ten billion, two hundred fifty-five million, four hundred thirty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •