Base | Representation |
---|---|
bin | 1001100000110010… |
… | …10100011110100101 |
3 | 111011220112222002002 |
4 | 10300121110132211 |
5 | 40424332124031 |
6 | 2202430455045 |
7 | 240361012523 |
oct | 46031243645 |
9 | 14156488062 |
10 | 5106911141 |
11 | 2190799a22 |
12 | ba6364485 |
13 | 635052017 |
14 | 366371313 |
15 | 1ed523ccb |
hex | 1306547a5 |
5106911141 has 4 divisors (see below), whose sum is σ = 5125085484. Its totient is φ = 5088736800.
The previous prime is 5106911113. The next prime is 5106911149. The reversal of 5106911141 is 1411196015.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3380841025 + 1726070116 = 58145^2 + 41546^2 .
It is a cyclic number.
It is not a de Polignac number, because 5106911141 - 214 = 5106894757 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 (5106911149) 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, 9086750 + ... + 9087311.
It is an arithmetic number, because the mean of its divisors is an integer number (1281271371).
Almost surely, 25106911141 is an apocalyptic number.
It is an amenable number.
5106911141 is a deficient number, since it is larger than the sum of its proper divisors (18174343).
5106911141 is a wasteful number, since it uses less digits than its factorization.
5106911141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18174342.
The product of its (nonzero) digits is 1080, while the sum is 29.
The square root of 5106911141 is about 71462.6555691852. The cubic root of 5106911141 is about 1722.0777960035.
The spelling of 5106911141 in words is "five billion, one hundred six million, nine hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •