Base | Representation |
---|---|
bin | 1101011011001… |
… | …0001100100101 |
3 | 10220221120010221 |
4 | 3112302030211 |
5 | 103403220141 |
6 | 5330444341 |
7 | 1252402555 |
oct | 326621445 |
9 | 126846127 |
10 | 56304421 |
11 | 29867388 |
12 | 16a336b1 |
13 | b884b34 |
14 | 7699165 |
15 | 4e22bd1 |
hex | 35b2325 |
56304421 has 2 divisors, whose sum is σ = 56304422. Its totient is φ = 56304420.
The previous prime is 56304419. The next prime is 56304431. The reversal of 56304421 is 12440365.
56304421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 36180225 + 20124196 = 6015^2 + 4486^2 .
It is a cyclic number.
It is not a de Polignac number, because 56304421 - 21 = 56304419 is a prime.
Together with 56304419, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56304431) 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 as a sum of consecutive naturals, namely, 28152210 + 28152211.
It is an arithmetic number, because the mean of its divisors is an integer number (28152211).
Almost surely, 256304421 is an apocalyptic number.
It is an amenable number.
56304421 is a deficient number, since it is larger than the sum of its proper divisors (1).
56304421 is an equidigital number, since it uses as much as digits as its factorization.
56304421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 56304421 is about 7503.6271895664. The cubic root of 56304421 is about 383.2782417782.
Adding to 56304421 its reverse (12440365), we get a palindrome (68744786).
The spelling of 56304421 in words is "fifty-six million, three hundred four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •