Base | Representation |
---|---|
bin | 10011101011111111011101 |
3 | 100201012110101 |
4 | 103223333131 |
5 | 2310122200 |
6 | 302341101 |
7 | 61603300 |
oct | 23537735 |
9 | 10635411 |
10 | 5160925 |
11 | 2a05530 |
12 | 188a791 |
13 | 10b9103 |
14 | 984b37 |
15 | 6be26a |
hex | 4ebfdd |
5160925 has 36 divisors (see below), whose sum is σ = 8142336. Its totient is φ = 3208800.
The previous prime is 5160923. The next prime is 5160941. The reversal of 5160925 is 5290615.
It is not a de Polignac number, because 5160925 - 21 = 5160923 is a prime.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5160893 and 5160902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5160923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 13284 + ... + 13666.
It is an arithmetic number, because the mean of its divisors is an integer number (226176).
Almost surely, 25160925 is an apocalyptic number.
5160925 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5160925 is a deficient number, since it is larger than the sum of its proper divisors (2981411).
5160925 is a wasteful number, since it uses less digits than its factorization.
5160925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418 (or 406 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 28.
The square root of 5160925 is about 2271.7669334683. The cubic root of 5160925 is about 172.8127770652.
The spelling of 5160925 in words is "five million, one hundred sixty thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •