Base | Representation |
---|---|
bin | 10100110000010001100000 |
3 | 101020102010000 |
4 | 110300101200 |
5 | 2343044413 |
6 | 312340000 |
7 | 64146555 |
oct | 24602140 |
9 | 11212100 |
10 | 5440608 |
11 | 3086678 |
12 | 19a4600 |
13 | 11864c4 |
14 | a18a2c |
15 | 727073 |
hex | 530460 |
5440608 has 60 divisors (see below), whose sum is σ = 16008300. Its totient is φ = 1812672.
The previous prime is 5440607. The next prime is 5440619. The reversal of 5440608 is 8060445.
5440608 is a `hidden beast` number, since 54 + 4 + 0 + 608 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5440607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1543 + ... + 3641.
It is an arithmetic number, because the mean of its divisors is an integer number (266805).
Almost surely, 25440608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5440608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8004150).
5440608 is an abundant number, since it is smaller than the sum of its proper divisors (10567692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5440608 is a wasteful number, since it uses less digits than its factorization.
5440608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2121 (or 2104 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
The square root of 5440608 is about 2332.5110932212. The cubic root of 5440608 is about 175.8797387806.
The spelling of 5440608 in words is "five million, four hundred forty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •