Base | Representation |
---|---|
bin | 10100111001100011001001 |
3 | 101022100020011 |
4 | 110321203021 |
5 | 2400303401 |
6 | 313231521 |
7 | 64365412 |
oct | 24714311 |
9 | 11270204 |
10 | 5478601 |
11 | 3102177 |
12 | 1a025a1 |
13 | 119a89b |
14 | a28809 |
15 | 733451 |
hex | 5398c9 |
5478601 has 4 divisors (see below), whose sum is σ = 5484672. Its totient is φ = 5472532.
The previous prime is 5478589. The next prime is 5478611. The reversal of 5478601 is 1068745.
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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5478601 - 25 = 5478569 is a prime.
It is a Smith number, since the sum of its digits (31) 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 not an unprimeable number, because it can be changed into a prime (5478611) 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 3 ways as a sum of consecutive naturals, for example, 1381 + ... + 3586.
It is an arithmetic number, because the mean of its divisors is an integer number (1371168).
Almost surely, 25478601 is an apocalyptic number.
It is an amenable number.
5478601 is a deficient number, since it is larger than the sum of its proper divisors (6071).
5478601 is a wasteful number, since it uses less digits than its factorization.
5478601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6070.
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 5478601 is about 2340.6411514797. The cubic root of 5478601 is about 176.2881921828.
The spelling of 5478601 in words is "five million, four hundred seventy-eight thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •