Base | Representation |
---|---|
bin | 1001111001110001… |
… | …01111110011101101 |
3 | 111201111212222012202 |
4 | 10330320233303231 |
5 | 41342004214031 |
6 | 2235314311245 |
7 | 245514205304 |
oct | 47470576355 |
9 | 14644788182 |
10 | 5316476141 |
11 | 2289015239 |
12 | 1044588525 |
13 | 6695a7b92 |
14 | 38612343b |
15 | 211b1c2cb |
hex | 13ce2fced |
5316476141 has 4 divisors (see below), whose sum is σ = 5317717692. Its totient is φ = 5315234592.
The previous prime is 5316475999. The next prime is 5316476149. The reversal of 5316476141 is 1416746135.
It is a happy number.
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 1275204100 + 4041272041 = 35710^2 + 63571^2 .
It is a cyclic number.
It is not a de Polignac number, because 5316476141 - 222 = 5312281837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5316476095 and 5316476104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5316476149) 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, 614330 + ... + 622923.
It is an arithmetic number, because the mean of its divisors is an integer number (1329429423).
Almost surely, 25316476141 is an apocalyptic number.
It is an amenable number.
5316476141 is a deficient number, since it is larger than the sum of its proper divisors (1241551).
5316476141 is a wasteful number, since it uses less digits than its factorization.
5316476141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1241550.
The product of its digits is 60480, while the sum is 38.
The square root of 5316476141 is about 72914.1696860082. The cubic root of 5316476141 is about 1745.3182224385.
The spelling of 5316476141 in words is "five billion, three hundred sixteen million, four hundred seventy-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •