Search a number
-
+
10102131 = 3313171693
BaseRepresentation
bin100110100010…
…010101110011
3201000020112000
4212202111303
510041232011
61000305043
7151603164
oct46422563
921006460
1010102131
11577a976
123472183
1321291c0
1414ad76b
15d48356
hex9a2573

10102131 has 32 divisors (see below), whose sum is σ = 17075520. Its totient is φ = 5847552.

The previous prime is 10102117. The next prime is 10102139. The reversal of 10102131 is 13120101.

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

It is not a de Polignac number, because 10102131 - 27 = 10102003 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5121 + ... + 6813.

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

Almost surely, 210102131 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 6, while the sum is 9.

The square root of 10102131 is about 3178.3849672436. The cubic root of 10102131 is about 216.1744347115.

Adding to 10102131 its reverse (13120101), we get a palindrome (23222232).

The spelling of 10102131 in words is "ten million, one hundred two thousand, one hundred thirty-one".

Divisors: 1 3 9 13 17 27 39 51 117 153 221 351 459 663 1693 1989 5079 5967 15237 22009 28781 45711 66027 86343 198081 259029 374153 594243 777087 1122459 3367377 10102131