Base | Representation |
---|---|
bin | 1101011001011… |
… | …1110101001111 |
3 | 10220202002000022 |
4 | 3112113311033 |
5 | 103341241211 |
6 | 5324252355 |
7 | 1251442664 |
oct | 326276517 |
9 | 126662008 |
10 | 56196431 |
11 | 297a3235 |
12 | 169a10bb |
13 | b847935 |
14 | 766ba6b |
15 | 4e00bdb |
hex | 3597d4f |
56196431 has 4 divisors (see below), whose sum is σ = 56238000. Its totient is φ = 56154864.
The previous prime is 56196421. The next prime is 56196467. The reversal of 56196431 is 13469165.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13469165 = 5 ⋅2693833.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56196431 is a prime.
It is a super-2 number, since 2×561964312 = 6316077714275522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56196391 and 56196400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56196421) 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, 18686 + ... + 21483.
It is an arithmetic number, because the mean of its divisors is an integer number (14059500).
Almost surely, 256196431 is an apocalyptic number.
56196431 is a deficient number, since it is larger than the sum of its proper divisors (41569).
56196431 is a wasteful number, since it uses less digits than its factorization.
56196431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41568.
The product of its digits is 19440, while the sum is 35.
The square root of 56196431 is about 7496.4278826652. The cubic root of 56196431 is about 383.0330466614.
The spelling of 56196431 in words is "fifty-six million, one hundred ninety-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •