Base | Representation |
---|---|
bin | 10110100111110011101101 |
3 | 102011021201211 |
4 | 112213303231 |
5 | 3004231341 |
6 | 331034421 |
7 | 101256163 |
oct | 26476355 |
9 | 12137654 |
10 | 5930221 |
11 | 3390510 |
12 | 1b9ba11 |
13 | 12c830b |
14 | b05233 |
15 | 7c2181 |
hex | 5a7ced |
5930221 has 4 divisors (see below), whose sum is σ = 6469344. Its totient is φ = 5391100.
The previous prime is 5930203. The next prime is 5930227. The reversal of 5930221 is 1220395.
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 not a de Polignac number, because 5930221 - 211 = 5928173 is a prime.
It is a super-2 number, since 2×59302212 = 70335042217682, which contains 22 as substring.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5930192 and 5930201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5930227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269545 + ... + 269566.
It is an arithmetic number, because the mean of its divisors is an integer number (1617336).
Almost surely, 25930221 is an apocalyptic number.
It is an amenable number.
5930221 is a deficient number, since it is larger than the sum of its proper divisors (539123).
5930221 is a wasteful number, since it uses less digits than its factorization.
5930221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539122.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 5930221 is about 2435.2045088657. The cubic root of 5930221 is about 181.0048837240.
The spelling of 5930221 in words is "five million, nine hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •