Base | Representation |
---|---|
bin | 1101011010110… |
… | …0010101010001 |
3 | 10220220100012022 |
4 | 3112230111101 |
5 | 103401433101 |
6 | 5330141225 |
7 | 1252242542 |
oct | 326542521 |
9 | 126810168 |
10 | 56280401 |
11 | 29850331 |
12 | 16a21815 |
13 | b876c18 |
14 | 76904c9 |
15 | 4e1aa1b |
hex | 35ac551 |
56280401 has 2 divisors, whose sum is σ = 56280402. Its totient is φ = 56280400.
The previous prime is 56280397. The next prime is 56280403. The reversal of 56280401 is 10408265.
56280401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48163600 + 8116801 = 6940^2 + 2849^2 .
It is a cyclic number.
It is not a de Polignac number, because 56280401 - 22 = 56280397 is a prime.
Together with 56280403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56280403) 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, 28140200 + 28140201.
It is an arithmetic number, because the mean of its divisors is an integer number (28140201).
Almost surely, 256280401 is an apocalyptic number.
It is an amenable number.
56280401 is a deficient number, since it is larger than the sum of its proper divisors (1).
56280401 is an equidigital number, since it uses as much as digits as its factorization.
56280401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
The square root of 56280401 is about 7502.0264595641. The cubic root of 56280401 is about 383.2237306482.
Adding to 56280401 its reverse (10408265), we get a palindrome (66688666).
The spelling of 56280401 in words is "fifty-six million, two hundred eighty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •