[go: up one dir, main page]

Search a number
-
+
101401111 = 746731019
BaseRepresentation
bin1100000101101…
…00001000010111
321001210201011201
412002310020113
5201424313421
614021213331
72340616030
oct602641027
9231721151
10101401111
1152269179
1229b61247
1318014476
14d677a87
158d7eb91
hex60b4217

101401111 has 8 divisors (see below), whose sum is σ = 116138880. Its totient is φ = 86726328.

The previous prime is 101401067. The next prime is 101401123. The reversal of 101401111 is 111104101.

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 101401111 - 27 = 101400983 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 2101401111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 31493.

The product of its (nonzero) digits is 4, while the sum is 10.

The square root of 101401111 is about 10069.8118651740. The cubic root of 101401111 is about 466.3166307658.

Adding to 101401111 its reverse (111104101), we get a palindrome (212505212).

The spelling of 101401111 in words is "one hundred one million, four hundred one thousand, one hundred eleven".

Divisors: 1 7 467 3269 31019 217133 14485873 101401111