Base | Representation |
---|---|
bin | 1010001111011010… |
… | …01101001001101001 |
3 | 112012011110100002210 |
4 | 11013231031021221 |
5 | 42224441444402 |
6 | 2305321115333 |
7 | 253150141311 |
oct | 50755151151 |
9 | 15164410083 |
10 | 5497999977 |
11 | 2371528838 |
12 | 1095328b49 |
13 | 698093532 |
14 | 3a2296441 |
15 | 222a2706c |
hex | 147b4d269 |
5497999977 has 4 divisors (see below), whose sum is σ = 7330666640. Its totient is φ = 3665333316.
The previous prime is 5497999973. The next prime is 5497999987. The reversal of 5497999977 is 7799997945.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5497999977 - 22 = 5497999973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5497999899 and 5497999908.
It is not an unprimeable number, because it can be changed into a prime (5497999973) 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 in 3 ways as a sum of consecutive naturals, for example, 916333327 + ... + 916333332.
It is an arithmetic number, because the mean of its divisors is an integer number (1832666660).
Almost surely, 25497999977 is an apocalyptic number.
It is an amenable number.
5497999977 is a deficient number, since it is larger than the sum of its proper divisors (1832666663).
5497999977 is a wasteful number, since it uses less digits than its factorization.
5497999977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1832666662.
The product of its digits is 405076140, while the sum is 75.
The square root of 5497999977 is about 74148.4994925723. The cubic root of 5497999977 is about 1764.9601787569.
The spelling of 5497999977 in words is "five billion, four hundred ninety-seven million, nine hundred ninety-nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •