Base | Representation |
---|---|
bin | 1010011011101011… |
… | …10100011001001001 |
3 | 112110100010021102111 |
4 | 11031311310121021 |
5 | 42432313434121 |
6 | 2323435102321 |
7 | 255540021133 |
oct | 51565643111 |
9 | 15410107374 |
10 | 5600921161 |
11 | 2414634a70 |
12 | 11038a19a1 |
13 | 6b34ba844 |
14 | 3b1c08053 |
15 | 22baa72e1 |
hex | 14dd74649 |
5600921161 has 4 divisors (see below), whose sum is σ = 6110095824. Its totient is φ = 5091746500.
The previous prime is 5600921147. The next prime is 5600921197. The reversal of 5600921161 is 1611290065.
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 a cyclic number.
It is not a de Polignac number, because 5600921161 - 25 = 5600921129 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5600921111) 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, 254587315 + ... + 254587336.
It is an arithmetic number, because the mean of its divisors is an integer number (1527523956).
Almost surely, 25600921161 is an apocalyptic number.
It is an amenable number.
5600921161 is a deficient number, since it is larger than the sum of its proper divisors (509174663).
5600921161 is a wasteful number, since it uses less digits than its factorization.
5600921161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509174662.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 5600921161 is about 74839.3022482171. The cubic root of 5600921161 is about 1775.9053674966.
The spelling of 5600921161 in words is "five billion, six hundred million, nine hundred twenty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •