Base | Representation |
---|---|
bin | 1101011101000… |
… | …0001001011101 |
3 | 10221011210102122 |
4 | 3113100021131 |
5 | 103421131401 |
6 | 5333232325 |
7 | 1253423333 |
oct | 327201135 |
9 | 127153378 |
10 | 56427101 |
11 | 29940575 |
12 | 16a926a5 |
13 | b8c8923 |
14 | 76cbb53 |
15 | 4e4921b |
hex | 35d025d |
56427101 has 2 divisors, whose sum is σ = 56427102. Its totient is φ = 56427100.
The previous prime is 56427089. The next prime is 56427103. The reversal of 56427101 is 10172465.
56427101 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., 33339076 + 23088025 = 5774^2 + 4805^2 .
It is a cyclic number.
It is not a de Polignac number, because 56427101 - 222 = 52232797 is a prime.
Together with 56427103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56427103) 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, 28213550 + 28213551.
It is an arithmetic number, because the mean of its divisors is an integer number (28213551).
Almost surely, 256427101 is an apocalyptic number.
It is an amenable number.
56427101 is a deficient number, since it is larger than the sum of its proper divisors (1).
56427101 is an equidigital number, since it uses as much as digits as its factorization.
56427101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 56427101 is about 7511.7974546709. The cubic root of 56427101 is about 383.5564109674.
Adding to 56427101 its reverse (10172465), we get a palindrome (66599566).
The spelling of 56427101 in words is "fifty-six million, four hundred twenty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •