Search a number
-
+
101966131 = 153166601
BaseRepresentation
bin1100001001111…
…10000100110011
321002212102020101
412010332010303
5202100404011
614041253231
72345461231
oct604760463
9232772211
10101966131
1152614733
122a194217
13181816b7
14d783951
158e422c1
hex613e133

101966131 has 4 divisors (see below), whose sum is σ = 102034264. Its totient is φ = 101898000.

The previous prime is 101966113. The next prime is 101966147. The reversal of 101966131 is 131669101.

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 101966131 - 27 = 101966003 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 101966131.

It is not an unprimeable number, because it can be changed into a prime (101964131) 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, 31770 + ... + 34831.

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

Almost surely, 2101966131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 68132.

The product of its (nonzero) digits is 972, while the sum is 28.

The square root of 101966131 is about 10097.8280337902. The cubic root of 101966131 is about 467.1811523714.

The spelling of 101966131 in words is "one hundred one million, nine hundred sixty-six thousand, one hundred thirty-one".

Divisors: 1 1531 66601 101966131