Base | Representation |
---|---|
bin | 1001111000011111… |
… | …00100011010000001 |
3 | 111200202120112210121 |
4 | 10330033210122001 |
5 | 41331223302122 |
6 | 2234251100241 |
7 | 245323356202 |
oct | 47417443201 |
9 | 14622515717 |
10 | 5305681537 |
11 | 2282a12082 |
12 | 1040a41681 |
13 | 667298740 |
14 | 3849135a9 |
15 | 210bd8bc7 |
hex | 13c3e4681 |
5305681537 has 8 divisors (see below), whose sum is σ = 5792083304. Its totient is φ = 4830461568.
The previous prime is 5305681523. The next prime is 5305681571. The reversal of 5305681537 is 7351865035.
It can be written as a sum of positive squares in 4 ways, for example, as 449821681 + 4855859856 = 21209^2 + 69684^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5305681537 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5305681493 and 5305681502.
It is not an unprimeable number, because it can be changed into a prime (5305681517) 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, 2794458 + ... + 2796355.
It is an arithmetic number, because the mean of its divisors is an integer number (724010413).
Almost surely, 25305681537 is an apocalyptic number.
It is an amenable number.
5305681537 is a deficient number, since it is larger than the sum of its proper divisors (486401767).
5305681537 is a wasteful number, since it uses less digits than its factorization.
5305681537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5590899.
The product of its (nonzero) digits is 378000, while the sum is 43.
The square root of 5305681537 is about 72840.1093972270. The cubic root of 5305681537 is about 1744.1361873255.
The spelling of 5305681537 in words is "five billion, three hundred five million, six hundred eighty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •