Search a number
-
+
10390215 = 351162971
BaseRepresentation
bin100111101000…
…101011000111
3201112212200210
4213220223013
510124441330
61010410503
7154213113
oct47505307
921485623
1010390215
115957360
123590a33
1321ca374
141546743
15da38b0
hex9e8ac7

10390215 has 16 divisors (see below), whose sum is σ = 18135936. Its totient is φ = 5037600.

The previous prime is 10390201. The next prime is 10390231. The reversal of 10390215 is 51209301.

It is not a de Polignac number, because 10390215 - 27 = 10390087 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10390191 and 10390200.

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

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

Almost surely, 210390215 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 62990.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 10390215 is about 3223.3856424573. The cubic root of 10390215 is about 218.2100982124.

Adding to 10390215 its reverse (51209301), we get a palindrome (61599516).

The spelling of 10390215 in words is "ten million, three hundred ninety thousand, two hundred fifteen".

Divisors: 1 3 5 11 15 33 55 165 62971 188913 314855 692681 944565 2078043 3463405 10390215