Base | Representation |
---|---|
bin | 1010101111110000… |
… | …01101010011100111 |
3 | 112220001222210201202 |
4 | 11113320031103213 |
5 | 43303421212110 |
6 | 2352252313115 |
7 | 262653256631 |
oct | 52770152347 |
9 | 15801883652 |
10 | 5769319655 |
11 | 24a06a3280 |
12 | 115017279b |
13 | 70c35bc18 |
14 | 3ca321a51 |
15 | 23b76d0a5 |
hex | 157e0d4e7 |
5769319655 has 16 divisors (see below), whose sum is σ = 7880937984. Its totient is φ = 4013438880.
The previous prime is 5769319651. The next prime is 5769319669. The reversal of 5769319655 is 5569139675.
It is a happy number.
It is not a de Polignac number, because 5769319655 - 22 = 5769319651 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5769319655.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5769319651) 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 15 ways as a sum of consecutive naturals, for example, 2279099 + ... + 2281628.
It is an arithmetic number, because the mean of its divisors is an integer number (492558624).
Almost surely, 25769319655 is an apocalyptic number.
5769319655 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5769319655 is a deficient number, since it is larger than the sum of its proper divisors (2111618329).
5769319655 is a wasteful number, since it uses less digits than its factorization.
5769319655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4560766.
The product of its digits is 7654500, while the sum is 56.
The square root of 5769319655 is about 75956.0376467862. The cubic root of 5769319655 is about 1793.5281634632.
The spelling of 5769319655 in words is "five billion, seven hundred sixty-nine million, three hundred nineteen thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •