Base | Representation |
---|---|
bin | 10100110110101111001000 |
3 | 101021202102110 |
4 | 110312233020 |
5 | 2344421310 |
6 | 313102320 |
7 | 64320003 |
oct | 24665710 |
9 | 11252373 |
10 | 5467080 |
11 | 30a4553 |
12 | 19b79a0 |
13 | 1195578 |
14 | a2453a |
15 | 72ed20 |
hex | 536bc8 |
5467080 has 64 divisors (see below), whose sum is σ = 16977600. Its totient is φ = 1406720.
The previous prime is 5467057. The next prime is 5467093. The reversal of 5467080 is 807645.
It is a happy number.
5467080 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2695 + ... + 4265.
It is an arithmetic number, because the mean of its divisors is an integer number (265275).
Almost surely, 25467080 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 5467080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8488800).
5467080 is an abundant number, since it is smaller than the sum of its proper divisors (11510520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5467080 is a wasteful number, since it uses less digits than its factorization.
5467080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1614 (or 1610 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 30.
The square root of 5467080 is about 2338.1787784513. The cubic root of 5467080 is about 176.1645327785.
It can be divided in two parts, 546 and 7080, that added together give a triangular number (7626 = T123).
The spelling of 5467080 in words is "five million, four hundred sixty-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •