Base | Representation |
---|---|
bin | 1010100010110111… |
… | …00011000111001101 |
3 | 112121112102212221112 |
4 | 11101123203013031 |
5 | 43043223043001 |
6 | 2333425541405 |
7 | 260200632356 |
oct | 52133430715 |
9 | 15545385845 |
10 | 5661143501 |
11 | 24456279a2 |
12 | 111baa4865 |
13 | 6c2b14a70 |
14 | 3b9c02d2d |
15 | 232000cbb |
hex | 1516e31cd |
5661143501 has 8 divisors (see below), whose sum is σ = 6104680344. Its totient is φ = 5218758720.
The previous prime is 5661143473. The next prime is 5661143533. The reversal of 5661143501 is 1053411665.
It can be written as a sum of positive squares in 4 ways, for example, as 36893476 + 5624250025 = 6074^2 + 74995^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 5661143501 - 222 = 5656949197 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 (5661143591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 277790 + ... + 297471.
It is an arithmetic number, because the mean of its divisors is an integer number (763085043).
Almost surely, 25661143501 is an apocalyptic number.
It is an amenable number.
5661143501 is a deficient number, since it is larger than the sum of its proper divisors (443536843).
5661143501 is a wasteful number, since it uses less digits than its factorization.
5661143501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576031.
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 5661143501 is about 75240.5708444586. The cubic root of 5661143501 is about 1782.2476656945.
The spelling of 5661143501 in words is "five billion, six hundred sixty-one million, one hundred forty-three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •