[go: up one dir, main page]

Search a number
-
+
10160495 = 52577907
BaseRepresentation
bin100110110000…
…100101101111
3201010012120122
4212300211233
510100113440
61001435155
7152235302
oct46604557
921105518
1010160495
11580a804
12349babb
132149937
1414c6b39
15d5a7b5
hex9b096f

10160495 has 8 divisors (see below), whose sum is σ = 12241584. Its totient is φ = 8095744.

The previous prime is 10160489. The next prime is 10160537. The reversal of 10160495 is 59406101.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10160495 - 28 = 10160239 is a prime.

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 2669 + ... + 5238.

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

Almost surely, 210160495 is an apocalyptic number.

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

10160495 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 8169.

The product of its (nonzero) digits is 1080, while the sum is 26.

The square root of 10160495 is about 3187.5531368120. The cubic root of 10160495 is about 216.5899439070.

Adding to 10160495 its reverse (59406101), we get a palindrome (69566596).

The spelling of 10160495 in words is "ten million, one hundred sixty thousand, four hundred ninety-five".

Divisors: 1 5 257 1285 7907 39535 2032099 10160495