Search a number
-
+
5095915 = 51128423
BaseRepresentation
bin10011011100000111101011
3100120220021121
4103130013223
52301032130
6301120111
761212616
oct23340753
910526247
105095915
112970700
121859037
131095646
1496917d
156a9d7a
hex4dc1eb

5095915 has 12 divisors (see below), whose sum is σ = 6722352. Its totient is φ = 3705680.

The previous prime is 5095877. The next prime is 5095919. The reversal of 5095915 is 5195905.

5095915 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 5095915 - 29 = 5095403 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (5095919) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3607 + ... + 4816.

It is an arithmetic number, because the mean of its divisors is an integer number (560196).

Almost surely, 25095915 is an apocalyptic number.

5095915 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

5095915 is a deficient number, since it is larger than the sum of its proper divisors (1626437).

5095915 is a wasteful number, since it uses less digits than its factorization.

5095915 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 8450 (or 8439 counting only the distinct ones).

The product of its (nonzero) digits is 10125, while the sum is 34.

The square root of 5095915 is about 2257.4133427443. The cubic root of 5095915 is about 172.0840921952.

The spelling of 5095915 in words is "five million, ninety-five thousand, nine hundred fifteen".

Divisors: 1 5 11 55 121 605 8423 42115 92653 463265 1019183 5095915