Base | Representation |
---|---|
bin | 1101011011111… |
… | …1110110000011 |
3 | 10221001101211101 |
4 | 3112333312003 |
5 | 103412012243 |
6 | 5331555231 |
7 | 1253024545 |
oct | 326776603 |
9 | 127041741 |
10 | 56360323 |
11 | 298a5388 |
12 | 16a5bb17 |
13 | b8a4406 |
14 | 76b1695 |
15 | 4e3454d |
hex | 35bfd83 |
56360323 has 8 divisors (see below), whose sum is σ = 57251376. Its totient is φ = 55476000.
The previous prime is 56360309. The next prime is 56360341. The reversal of 56360323 is 32306365.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56360323 is a prime.
It is a super-3 number, since 3×563603233 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56360291 and 56360300.
It is not an unprimeable number, because it can be changed into a prime (56360383) 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 7 ways as a sum of consecutive naturals, for example, 16740 + ... + 19822.
It is an arithmetic number, because the mean of its divisors is an integer number (7156422).
Almost surely, 256360323 is an apocalyptic number.
56360323 is a deficient number, since it is larger than the sum of its proper divisors (891053).
56360323 is a wasteful number, since it uses less digits than its factorization.
56360323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3365.
The product of its (nonzero) digits is 9720, while the sum is 28.
The square root of 56360323 is about 7507.3512639279. The cubic root of 56360323 is about 383.4050461087.
Adding to 56360323 its reverse (32306365), we get a palindrome (88666688).
The spelling of 56360323 in words is "fifty-six million, three hundred sixty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •