Search a number
-
+
10702161 = 323189431
BaseRepresentation
bin101000110100…
…110101010001
3202010201121100
4220310311101
510214432121
61021215013
7156652431
oct50646521
922121540
1010702161
11604a768
123701469
1322a9352
1415c82c1
15e16026
hexa34d51

10702161 has 24 divisors (see below), whose sum is σ = 16174080. Its totient is φ = 6811200.

The previous prime is 10702157. The next prime is 10702171. The reversal of 10702161 is 16120701.

It is not a de Polignac number, because 10702161 - 22 = 10702157 is a prime.

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

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24616 + ... + 25046.

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

Almost surely, 210702161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 84, while the sum is 18.

The square root of 10702161 is about 3271.4157485713. The cubic root of 10702161 is about 220.3723789858.

Adding to 10702161 its reverse (16120701), we get a palindrome (26822862).

The spelling of 10702161 in words is "ten million, seven hundred two thousand, one hundred sixty-one".

Divisors: 1 3 9 31 89 93 267 279 431 801 1293 2759 3879 8277 13361 24831 38359 40083 115077 120249 345231 1189129 3567387 10702161