Search a number
-
+
10485295 = 513715307
BaseRepresentation
bin100111111111…
…111000101111
3201201201010021
4213333320233
510141012140
61012423011
7155060242
oct47777057
921651107
1010485295
115a11837
123617a67
132231722
14156d259
15dc1b4a
hex9ffe2f

10485295 has 8 divisors (see below), whose sum is σ = 12675024. Its totient is φ = 8326464.

The previous prime is 10485287. The next prime is 10485317. The reversal of 10485295 is 59258401.

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 10485295 - 23 = 10485287 is a prime.

It is a super-2 number, since 2×104852952 = 219882822474050, which contains 22 as substring.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10485295.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6969 + ... + 8338.

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

Almost surely, 210485295 is an apocalyptic number.

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

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

10485295 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 15449.

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

The square root of 10485295 is about 3238.1005234551. The cubic root of 10485295 is about 218.8736856987.

The spelling of 10485295 in words is "ten million, four hundred eighty-five thousand, two hundred ninety-five".

Divisors: 1 5 137 685 15307 76535 2097059 10485295