Search a number
-
+
102100000131 = 3237306606607
BaseRepresentation
bin101111100010110100…
…0100101110110000011
3100202112112011101212100
41133011220211312003
53133100100001011
6114523141201443
710243063452603
oct1370550456603
9322475141770
10102100000131
113a3338742a8
1217955100283
1398218ca67c
144d27d0ac03
1529c87a1d56
hex17c5a25d83

102100000131 has 12 divisors (see below), whose sum is σ = 151463664352. Its totient is φ = 66227026896.

The previous prime is 102100000127. The next prime is 102100000139. The reversal of 102100000131 is 131000001201.

It is not a de Polignac number, because 102100000131 - 22 = 102100000127 is a prime.

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

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (102100000139) 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 11 ways as a sum of consecutive naturals, for example, 153302971 + ... + 153303636.

Almost surely, 2102100000131 is an apocalyptic number.

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

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

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

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

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

Adding to 102100000131 its reverse (131000001201), we get a palindrome (233100001332).

The spelling of 102100000131 in words is "one hundred two billion, one hundred million, one hundred thirty-one", and thus it is an aban number.

Divisors: 1 3 9 37 111 333 306606607 919819821 2759459463 11344444459 34033333377 102100000131