Base | Representation |
---|---|
bin | 1010010011011100… |
… | …00011011110110101 |
3 | 112021112000101101202 |
4 | 11021232003132311 |
5 | 42312113330244 |
6 | 2312525102245 |
7 | 254040220406 |
oct | 51156033665 |
9 | 15245011352 |
10 | 5531776949 |
11 | 23895a8996 |
12 | 10a46b7985 |
13 | 6a208b6ca |
14 | 3a69699ad |
15 | 22599a04e |
hex | 149b837b5 |
5531776949 has 8 divisors (see below), whose sum is σ = 5669468952. Its totient is φ = 5394216960.
The previous prime is 5531776937. The next prime is 5531776967. The reversal of 5531776949 is 9496771355.
It can be written as a sum of positive squares in 4 ways, for example, as 1483636324 + 4048140625 = 38518^2 + 63625^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-5531776949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5531776894 and 5531776903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5531776919) 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, 54707 + ... + 118559.
It is an arithmetic number, because the mean of its divisors is an integer number (708683619).
Almost surely, 25531776949 is an apocalyptic number.
It is an amenable number.
5531776949 is a deficient number, since it is larger than the sum of its proper divisors (137692003).
5531776949 is a wasteful number, since it uses less digits than its factorization.
5531776949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66007.
The product of its digits is 7144200, while the sum is 56.
The square root of 5531776949 is about 74375.9164582192. The cubic root of 5531776949 is about 1768.5671476014.
The spelling of 5531776949 in words is "five billion, five hundred thirty-one million, seven hundred seventy-six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •