Search a number
-
+
10102010131 = 41246390491
BaseRepresentation
bin10010110100010000…
…00111000100010011
3222002000201021201101
421122020013010103
5131142103311011
64350225045231
7505223445403
oct113210070423
928060637641
1010102010131
114314359804
121b5b186817
13c4cb85bb5
146bb918803
153e1d0d2c1
hex25a207113

10102010131 has 4 divisors (see below), whose sum is σ = 10348400664. Its totient is φ = 9855619600.

The previous prime is 10102010119. The next prime is 10102010179. The reversal of 10102010131 is 13101020101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10102010131 - 223 = 10093621523 is a prime.

It is a super-2 number, since 2×101020101312 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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 3 ways as a sum of consecutive naturals, for example, 123195205 + ... + 123195286.

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

Almost surely, 210102010131 is an apocalyptic number.

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

10102010131 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 246390532.

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

Adding to 10102010131 its reverse (13101020101), we get a palindrome (23203030232).

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

Divisors: 1 41 246390491 10102010131