Base | Representation |
---|---|
bin | 1001101011011100… |
… | …11001011110110101 |
3 | 111102010210112201211 |
4 | 10311232121132311 |
5 | 41120224311431 |
6 | 2215343121421 |
7 | 242525004661 |
oct | 46556313665 |
9 | 14363715654 |
10 | 5196322741 |
11 | 2227209205 |
12 | 10102a3271 |
13 | 64a7291ac |
14 | 3741a78a1 |
15 | 2062d62b1 |
hex | 135b997b5 |
5196322741 has 8 divisors (see below), whose sum is σ = 5245055640. Its totient is φ = 5147638272.
The previous prime is 5196322727. The next prime is 5196322777. The reversal of 5196322741 is 1472236915.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 722050641 + 4474272100 = 26871^2 + 66890^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5196322741 - 25 = 5196322709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5196322694 and 5196322703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5196326741) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 225051 + ... + 247063.
It is an arithmetic number, because the mean of its divisors is an integer number (655631955).
Almost surely, 25196322741 is an apocalyptic number.
It is an amenable number.
5196322741 is a deficient number, since it is larger than the sum of its proper divisors (48732899).
5196322741 is a wasteful number, since it uses less digits than its factorization.
5196322741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24215.
The product of its digits is 90720, while the sum is 40.
The square root of 5196322741 is about 72085.5237963906. The cubic root of 5196322741 is about 1732.0697316169.
The spelling of 5196322741 in words is "five billion, one hundred ninety-six million, three hundred twenty-two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •