Base | Representation |
---|---|
bin | 10101001011100001010011 |
3 | 101110002012110 |
4 | 111023201103 |
5 | 2410132321 |
6 | 315000403 |
7 | 65123130 |
oct | 25134123 |
9 | 11402173 |
10 | 5552211 |
11 | 3152505 |
12 | 1a39103 |
13 | 11c5242 |
14 | a47587 |
15 | 74a176 |
hex | 54b853 |
5552211 has 8 divisors (see below), whose sum is σ = 8460544. Its totient is φ = 3172680.
The previous prime is 5552207. The next prime is 5552219. The reversal of 5552211 is 1122555.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5552211 - 22 = 5552207 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 264391 = 5552211 / (5 + 5 + 5 + 2 + 2 + 1 + 1).
It is a Duffinian number.
5552211 is a lucky number.
It is a nialpdrome in base 10.
It is a zygodrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (5552219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 132175 + ... + 132216.
It is an arithmetic number, because the mean of its divisors is an integer number (1057568).
Almost surely, 25552211 is an apocalyptic number.
5552211 is a deficient number, since it is larger than the sum of its proper divisors (2908333).
5552211 is a wasteful number, since it uses less digits than its factorization.
5552211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264401.
The product of its digits is 500, while the sum is 21.
The square root of 5552211 is about 2356.3130097676. The cubic root of 5552211 is about 177.0742131897.
Adding to 5552211 its reverse (1122555), we get a palindrome (6674766).
The spelling of 5552211 in words is "five million, five hundred fifty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •