Base | Representation |
---|---|
bin | 1101010001000… |
… | …0101101110101 |
3 | 10212200221211202 |
4 | 3110100231311 |
5 | 103221033442 |
6 | 5304342245 |
7 | 1243646324 |
oct | 324205565 |
9 | 125627752 |
10 | 55642997 |
11 | 29455453 |
12 | 16774985 |
13 | b6b2a67 |
14 | 75660bb |
15 | 4d41c32 |
hex | 3510b75 |
55642997 has 2 divisors, whose sum is σ = 55642998. Its totient is φ = 55642996.
The previous prime is 55642973. The next prime is 55643017. The reversal of 55642997 is 79924655.
55642997 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., 52867441 + 2775556 = 7271^2 + 1666^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55642997 is a prime.
It is a super-2 number, since 2×556429972 = 6192286230284018, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55642927) 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, 27821498 + 27821499.
It is an arithmetic number, because the mean of its divisors is an integer number (27821499).
Almost surely, 255642997 is an apocalyptic number.
It is an amenable number.
55642997 is a deficient number, since it is larger than the sum of its proper divisors (1).
55642997 is an equidigital number, since it uses as much as digits as its factorization.
55642997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 680400, while the sum is 47.
The square root of 55642997 is about 7459.4233691352. The cubic root of 55642997 is about 381.7715001800.
The spelling of 55642997 in words is "fifty-five million, six hundred forty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •