Base | Representation |
---|---|
bin | 1010001111000000… |
… | …11110101010110101 |
3 | 112011221011211210221 |
4 | 11013200132222311 |
5 | 42223113220421 |
6 | 2305121414341 |
7 | 253106605111 |
oct | 50740365265 |
9 | 15157154727 |
10 | 5494663861 |
11 | 236a65a315 |
12 | 109419a3b1 |
13 | 697495bbb |
14 | 3a1a68741 |
15 | 2225b8841 |
hex | 14781eab5 |
5494663861 has 2 divisors, whose sum is σ = 5494663862. Its totient is φ = 5494663860.
The previous prime is 5494663849. The next prime is 5494663919. The reversal of 5494663861 is 1683664945.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3021590961 + 2473072900 = 54969^2 + 49730^2 .
It is a cyclic number.
It is not a de Polignac number, because 5494663861 - 25 = 5494663829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5494663799 and 5494663808.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5494663961) 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 as a sum of consecutive naturals, namely, 2747331930 + 2747331931.
It is an arithmetic number, because the mean of its divisors is an integer number (2747331931).
Almost surely, 25494663861 is an apocalyptic number.
It is an amenable number.
5494663861 is a deficient number, since it is larger than the sum of its proper divisors (1).
5494663861 is an equidigital number, since it uses as much as digits as its factorization.
5494663861 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3732480, while the sum is 52.
The square root of 5494663861 is about 74125.9998988209. Note that the first 3 decimals coincide. The cubic root of 5494663861 is about 1764.6031214474.
The spelling of 5494663861 in words is "five billion, four hundred ninety-four million, six hundred sixty-three thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •