Base | Representation |
---|---|
bin | 1010011101001111… |
… | …11100100011001101 |
3 | 112111020211212221211 |
4 | 11032213330203031 |
5 | 42444144434043 |
6 | 2325024454421 |
7 | 256056511015 |
oct | 51647744315 |
9 | 15436755854 |
10 | 5614061773 |
11 | 2420a9a781 |
12 | 110817a411 |
13 | 6b613ba58 |
14 | 3b3868c45 |
15 | 22cd00a9d |
hex | 14e9fc8cd |
5614061773 has 8 divisors (see below), whose sum is σ = 5809109400. Its totient is φ = 5419111488.
The previous prime is 5614061771. The next prime is 5614061821. The reversal of 5614061773 is 3771604165.
It can be written as a sum of positive squares in 4 ways, for example, as 2738742889 + 2875318884 = 52333^2 + 53622^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 5614061773 - 21 = 5614061771 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 (5614061771) 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, 104683 + ... + 148951.
It is an arithmetic number, because the mean of its divisors is an integer number (726138675).
Almost surely, 25614061773 is an apocalyptic number.
It is an amenable number.
5614061773 is a deficient number, since it is larger than the sum of its proper divisors (195047627).
5614061773 is a wasteful number, since it uses less digits than its factorization.
5614061773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48671.
The product of its (nonzero) digits is 105840, while the sum is 40.
The square root of 5614061773 is about 74927.0430018428. The cubic root of 5614061773 is about 1777.2931306967.
The spelling of 5614061773 in words is "five billion, six hundred fourteen million, sixty-one thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •