Base | Representation |
---|---|
bin | 1101011000111… |
… | …1001111001111 |
3 | 10220200021201121 |
4 | 3112033033033 |
5 | 103334124411 |
6 | 5323421411 |
7 | 1251235240 |
oct | 326171717 |
9 | 126607647 |
10 | 56161231 |
11 | 29779845 |
12 | 16984867 |
13 | b8348c9 |
14 | 765ccc7 |
15 | 4de5571 |
hex | 358f3cf |
56161231 has 4 divisors (see below), whose sum is σ = 64184272. Its totient is φ = 48138192.
The previous prime is 56161219. The next prime is 56161247. The reversal of 56161231 is 13216165.
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 56161231 - 25 = 56161199 is a prime.
It is a super-2 number, since 2×561612312 = 6308167734870722, 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 = 56161196 and 56161205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56161201) 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, 4011510 + ... + 4011523.
It is an arithmetic number, because the mean of its divisors is an integer number (16046068).
Almost surely, 256161231 is an apocalyptic number.
56161231 is a deficient number, since it is larger than the sum of its proper divisors (8023041).
56161231 is an equidigital number, since it uses as much as digits as its factorization.
56161231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8023040.
The product of its digits is 1080, while the sum is 25.
The square root of 56161231 is about 7494.0797300269. The cubic root of 56161231 is about 382.9530559392.
Adding to 56161231 its reverse (13216165), we get a palindrome (69377396).
The spelling of 56161231 in words is "fifty-six million, one hundred sixty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •