Search a number
-
+
101431111 = 173661887
BaseRepresentation
bin1100000101110…
…11011101000111
321001212020022211
412002323131013
5201431243421
614022004251
72341102345
oct602733507
9231766284
10101431111
1152289771
1229b76687
1318025012
14d684995
158d889e1
hex60bb747

101431111 has 8 divisors (see below), whose sum is σ = 102286944. Its totient is φ = 100578720.

The previous prime is 101431103. The next prime is 101431117. The reversal of 101431111 is 111134101.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 101431111 - 23 = 101431103 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 101431091 and 101431100.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113910 + ... + 114796.

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

Almost surely, 2101431111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1721.

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

The square root of 101431111 is about 10071.3013558328. The cubic root of 101431111 is about 466.3626135609.

Adding to 101431111 its reverse (111134101), we get a palindrome (212565212).

The spelling of 101431111 in words is "one hundred one million, four hundred thirty-one thousand, one hundred eleven".

Divisors: 1 173 661 887 114353 153451 586307 101431111