Base | Representation |
---|---|
bin | 1101100001110… |
… | …0010100011101 |
3 | 10221202122102012 |
4 | 3120130110131 |
5 | 104011122401 |
6 | 5344041005 |
7 | 1256163056 |
oct | 330342435 |
9 | 127678365 |
10 | 56739101 |
11 | 2a033a21 |
12 | 17003165 |
13 | b9a7943 |
14 | 776d72d |
15 | 4eab8bb |
hex | 361c51d |
56739101 has 4 divisors (see below), whose sum is σ = 56987100. Its totient is φ = 56491104.
The previous prime is 56739071. The next prime is 56739103. The reversal of 56739101 is 10193765.
56739101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 49716601 + 7022500 = 7051^2 + 2650^2 .
It is a cyclic number.
It is not a de Polignac number, because 56739101 - 214 = 56722717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56739103) 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 in 3 ways as a sum of consecutive naturals, for example, 123656 + ... + 124113.
It is an arithmetic number, because the mean of its divisors is an integer number (14246775).
Almost surely, 256739101 is an apocalyptic number.
It is an amenable number.
56739101 is a deficient number, since it is larger than the sum of its proper divisors (247999).
56739101 is a wasteful number, since it uses less digits than its factorization.
56739101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247998.
The product of its (nonzero) digits is 5670, while the sum is 32.
The square root of 56739101 is about 7532.5361598867. The cubic root of 56739101 is about 384.2620394791.
The spelling of 56739101 in words is "fifty-six million, seven hundred thirty-nine thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •