Base | Representation |
---|---|
bin | 1101010111011… |
… | …0111010111111 |
3 | 10220111020002201 |
4 | 3111312322333 |
5 | 103322433011 |
6 | 5321332331 |
7 | 1250341663 |
oct | 325667277 |
9 | 126436081 |
10 | 56061631 |
11 | 29710a2a |
12 | 169370a7 |
13 | b7cb482 |
14 | 76348a3 |
15 | 4dc5cc1 |
hex | 3576ebf |
56061631 has 4 divisors (see below), whose sum is σ = 59359392. Its totient is φ = 52763872.
The previous prime is 56061613. The next prime is 56061641. The reversal of 56061631 is 13616065.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 56061631 - 217 = 55930559 is a prime.
It is a super-2 number, since 2×560616312 = 6285812940760322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 56061631.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56061601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1648855 + ... + 1648888.
It is an arithmetic number, because the mean of its divisors is an integer number (14839848).
Almost surely, 256061631 is an apocalyptic number.
56061631 is a deficient number, since it is larger than the sum of its proper divisors (3297761).
56061631 is a wasteful number, since it uses less digits than its factorization.
56061631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3297760.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 56061631 is about 7487.4315355801. The cubic root of 56061631 is about 382.7265373139.
Adding to 56061631 its reverse (13616065), we get a palindrome (69677696).
The spelling of 56061631 in words is "fifty-six million, sixty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •