Search a number
-
+
105010112131 = 59230166651
BaseRepresentation
bin110000111001100010…
…1110010011010000011
3101001001100001102001021
41201303011302122003
53210030042042011
6120124015050311
710405151140261
oct1416305623203
9331040042037
10105010112131
114059751a541
1218427810997
139b9679bc32
1451225d5431
152ae8edc471
hex1873172683

105010112131 has 6 divisors (see below), whose sum is σ = 106820114732. Its totient is φ = 103230276300.

The previous prime is 105010112107. The next prime is 105010112149. The reversal of 105010112131 is 131211010501.

It is a happy number.

It is not a de Polignac number, because 105010112131 - 25 = 105010112099 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15079845 + ... + 15086806.

Almost surely, 2105010112131 is an apocalyptic number.

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

105010112131 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 105010112131 its reverse (131211010501), we get a palindrome (236221122632).

The spelling of 105010112131 in words is "one hundred five billion, ten million, one hundred twelve thousand, one hundred thirty-one".

Divisors: 1 59 3481 30166651 1779832409 105010112131