Base | Representation |
---|---|
bin | 1101001100001… |
… | …0001010111101 |
3 | 10212002121112012 |
4 | 3103002022331 |
5 | 103130240102 |
6 | 5253421005 |
7 | 1241136344 |
oct | 323021275 |
9 | 125077465 |
10 | 55321277 |
11 | 29255770 |
12 | 1663a765 |
13 | b5cc4ab |
14 | 74c0b5b |
15 | 4ccb752 |
hex | 34c22bd |
55321277 has 4 divisors (see below), whose sum is σ = 60350496. Its totient is φ = 50292060.
The previous prime is 55321271. The next prime is 55321289. The reversal of 55321277 is 77212355.
55321277 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55321277 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55321271) 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 3 ways as a sum of consecutive naturals, for example, 2514593 + ... + 2514614.
It is an arithmetic number, because the mean of its divisors is an integer number (15087624).
Almost surely, 255321277 is an apocalyptic number.
It is an amenable number.
55321277 is a deficient number, since it is larger than the sum of its proper divisors (5029219).
55321277 is a wasteful number, since it uses less digits than its factorization.
55321277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5029218.
The product of its digits is 14700, while the sum is 32.
The square root of 55321277 is about 7437.8274381704. The cubic root of 55321277 is about 381.0342944631.
The spelling of 55321277 in words is "fifty-five million, three hundred twenty-one thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •