Base | Representation |
---|---|
bin | 1010100001101110… |
… | …11000000100000101 |
3 | 112120212121010111001 |
4 | 11100313120010011 |
5 | 43033311123221 |
6 | 2332450413301 |
7 | 260024216644 |
oct | 52067300405 |
9 | 15525533431 |
10 | 5651661061 |
11 | 2440240672 |
12 | 1118891231 |
13 | 6c0b74957 |
14 | 3b885535b |
15 | 23127b391 |
hex | 150dd8105 |
5651661061 has 2 divisors, whose sum is σ = 5651661062. Its totient is φ = 5651661060.
The previous prime is 5651661007. The next prime is 5651661077. The reversal of 5651661061 is 1601661565.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3152261025 + 2499400036 = 56145^2 + 49994^2 .
It is a cyclic number.
It is not a de Polignac number, because 5651661061 - 29 = 5651660549 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5651661061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5651661091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2825830530 + 2825830531.
It is an arithmetic number, because the mean of its divisors is an integer number (2825830531).
Almost surely, 25651661061 is an apocalyptic number.
It is an amenable number.
5651661061 is a deficient number, since it is larger than the sum of its proper divisors (1).
5651661061 is an equidigital number, since it uses as much as digits as its factorization.
5651661061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 5651661061 is about 75177.5302932997. The cubic root of 5651661061 is about 1781.2520187177.
The spelling of 5651661061 in words is "five billion, six hundred fifty-one million, six hundred sixty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •