Search a number
-
+
32100101131 = 717299301681
BaseRepresentation
bin11101111001010100…
…001010110000001011
310001212010000002112111
4131321110022300023
51011220111214011
622425132323151
72214320233450
oct357124126013
9101763002474
1032100101131
11126827410aa
12627a3134b7
1330474b9ca7
1417a731d827
15c7d1b1121
hex77950ac0b

32100101131 has 16 divisors (see below), whose sum is σ = 40183266240. Its totient is φ = 25002915840.

The previous prime is 32100101119. The next prime is 32100101141. The reversal of 32100101131 is 13110100123.

It is not a de Polignac number, because 32100101131 - 221 = 32098003979 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 232100101131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 9301734.

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

Adding to 32100101131 its reverse (13110100123), we get a palindrome (45210201254).

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

Divisors: 1 7 17 29 119 203 493 3451 9301681 65111767 158128577 269748749 1106900039 1888241243 4585728733 32100101131