Base | Representation |
---|---|
bin | 1101100001100… |
… | …0111011100111 |
3 | 10221201221101012 |
4 | 3120120323213 |
5 | 104010201343 |
6 | 5343452435 |
7 | 1256104442 |
oct | 330307347 |
9 | 127657335 |
10 | 56725223 |
11 | 2a024555 |
12 | 16bb711b |
13 | b9a1529 |
14 | 7768659 |
15 | 4ea7718 |
hex | 3618ee7 |
56725223 has 4 divisors (see below), whose sum is σ = 56740368. Its totient is φ = 56710080.
The previous prime is 56725217. The next prime is 56725267. The reversal of 56725223 is 32252765.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 32252765 = 5 ⋅6450553.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56725223 is a prime.
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 56725223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56725523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2615 + ... + 10967.
It is an arithmetic number, because the mean of its divisors is an integer number (14185092).
Almost surely, 256725223 is an apocalyptic number.
56725223 is a deficient number, since it is larger than the sum of its proper divisors (15145).
56725223 is an equidigital number, since it uses as much as digits as its factorization.
56725223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15144.
The product of its digits is 25200, while the sum is 32.
The square root of 56725223 is about 7531.6148998737. The cubic root of 56725223 is about 384.2307076266.
Adding to 56725223 its reverse (32252765), we get a palindrome (88977988).
The spelling of 56725223 in words is "fifty-six million, seven hundred twenty-five thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •