Base | Representation |
---|---|
bin | 1010100011001111… |
… | …11101101000110101 |
3 | 112121202120020002222 |
4 | 11101213331220311 |
5 | 43100041213002 |
6 | 2334023412125 |
7 | 260240405345 |
oct | 52147755065 |
9 | 15552506088 |
10 | 5664397877 |
11 | 244744aa66 |
12 | 1120bb4045 |
13 | 6c36b4128 |
14 | 3ba40cd25 |
15 | 2324451a2 |
hex | 1519fda35 |
5664397877 has 8 divisors (see below), whose sum is σ = 5718713880. Its totient is φ = 5610124800.
The previous prime is 5664397867. The next prime is 5664397891. The reversal of 5664397877 is 7787934665.
It can be written as a sum of positive squares in 4 ways, for example, as 311134321 + 5353263556 = 17639^2 + 73166^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 5664397877 - 212 = 5664393781 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 (5664397867) 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, 296033 + ... + 314585.
It is an arithmetic number, because the mean of its divisors is an integer number (714839235).
Almost surely, 25664397877 is an apocalyptic number.
It is an amenable number.
5664397877 is a deficient number, since it is larger than the sum of its proper divisors (54316003).
5664397877 is a wasteful number, since it uses less digits than its factorization.
5664397877 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21463.
The product of its digits is 53343360, while the sum is 62.
The square root of 5664397877 is about 75262.1942079820. The cubic root of 5664397877 is about 1782.5891157309.
The spelling of 5664397877 in words is "five billion, six hundred sixty-four million, three hundred ninety-seven thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •