Base | Representation |
---|---|
bin | 1001101110010100… |
… | …11111001010011101 |
3 | 111110211020000022011 |
4 | 10313022133022131 |
5 | 41142414311021 |
6 | 2222004351221 |
7 | 243240130336 |
oct | 46712371235 |
9 | 14424200264 |
10 | 5220463261 |
11 | 22398a7352 |
12 | 10183a5511 |
13 | 65272c120 |
14 | 37748d28d |
15 | 2084a3de1 |
hex | 13729f29d |
5220463261 has 8 divisors (see below), whose sum is σ = 5622785784. Its totient is φ = 4818247680.
The previous prime is 5220463231. The next prime is 5220463301. The reversal of 5220463261 is 1623640225.
It can be written as a sum of positive squares in 4 ways, for example, as 293265625 + 4927197636 = 17125^2 + 70194^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 5220463261 - 27 = 5220463133 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 (5220463231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95325 + ... + 139741.
It is an arithmetic number, because the mean of its divisors is an integer number (702848223).
Almost surely, 25220463261 is an apocalyptic number.
It is an amenable number.
5220463261 is a deficient number, since it is larger than the sum of its proper divisors (402322523).
5220463261 is a wasteful number, since it uses less digits than its factorization.
5220463261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53471.
The product of its (nonzero) digits is 17280, while the sum is 31.
The square root of 5220463261 is about 72252.7733792967. The cubic root of 5220463261 is about 1734.7478101005.
The spelling of 5220463261 in words is "five billion, two hundred twenty million, four hundred sixty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •