Base | Representation |
---|---|
bin | 1101011001110… |
… | …0001100110001 |
3 | 10220202222112220 |
4 | 3112130030301 |
5 | 103342324241 |
6 | 5324511253 |
7 | 1251546102 |
oct | 326341461 |
9 | 126688486 |
10 | 56214321 |
11 | 29805719 |
12 | 169ab529 |
13 | b852b17 |
14 | 76743a9 |
15 | 4e06166 |
hex | 359c331 |
56214321 has 24 divisors (see below), whose sum is σ = 78403392. Its totient is φ = 35817600.
The previous prime is 56214289. The next prime is 56214329. The reversal of 56214321 is 12341265.
56214321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 56214321 - 25 = 56214289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56214291 and 56214300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56214329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 357975 + ... + 358131.
It is an arithmetic number, because the mean of its divisors is an integer number (3266808).
Almost surely, 256214321 is an apocalyptic number.
It is an amenable number.
56214321 is a deficient number, since it is larger than the sum of its proper divisors (22189071).
56214321 is a wasteful number, since it uses less digits than its factorization.
56214321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313 (or 272 counting only the distinct ones).
The product of its digits is 1440, while the sum is 24.
The square root of 56214321 is about 7497.6210226978. The cubic root of 56214321 is about 383.0736882352.
Adding to 56214321 its reverse (12341265), we get a palindrome (68555586).
The spelling of 56214321 in words is "fifty-six million, two hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •