Base | Representation |
---|---|
bin | 10011011000100010000000 |
3 | 100120011010012 |
4 | 103120202000 |
5 | 2300044331 |
6 | 300524052 |
7 | 61122020 |
oct | 23304200 |
9 | 10504105 |
10 | 5081216 |
11 | 2960658 |
12 | 1850628 |
13 | 108ba4a |
14 | 963a80 |
15 | 6a582b |
hex | 4d8880 |
5081216 has 64 divisors (see below), whose sum is σ = 11897280. Its totient is φ = 2116608.
The previous prime is 5081191. The next prime is 5081231. The reversal of 5081216 is 6121805.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 5081191 and 5081200.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 47435 + ... + 47541.
It is an arithmetic number, because the mean of its divisors is an integer number (185895).
Almost surely, 25081216 is an apocalyptic number.
5081216 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5081216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5948640).
5081216 is an abundant number, since it is smaller than the sum of its proper divisors (6816064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5081216 is a wasteful number, since it uses less digits than its factorization.
5081216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181 (or 169 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 5081216 is about 2254.1552741548. The cubic root of 5081216 is about 171.9184758779.
The spelling of 5081216 in words is "five million, eighty-one thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •