Search a number
-
+
10485211 = 112932869
BaseRepresentation
bin100111111111…
…110111011011
3201201201000011
4213333313123
510141011321
61012422351
7155060062
oct47776733
921651004
1010485211
115a11770
1236179b7
132231689
14156d1d9
15dc1ae1
hex9ffddb

10485211 has 8 divisors (see below), whose sum is σ = 11833200. Its totient is φ = 9203040.

The previous prime is 10485203. The next prime is 10485239. The reversal of 10485211 is 11258401.

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

It is not a de Polignac number, because 10485211 - 23 = 10485203 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 210485211 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 32909.

The product of its (nonzero) digits is 320, while the sum is 22.

The square root of 10485211 is about 3238.0875528620. The cubic root of 10485211 is about 218.8731012154.

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

Divisors: 1 11 29 319 32869 361559 953201 10485211