Search a number
-
+
101141001001 = 195323210579
BaseRepresentation
bin101111000110001111…
…0010011001100101001
3100200001200122012101001
41132030132103030221
53124114044013001
6114244042355001
710210240216015
oct1361436231451
9320050565331
10101141001001
1139991505037
1217727abba61
1396cb017771
144c767d3545
15296e4be001
hex178c793329

101141001001 has 4 divisors (see below), whose sum is σ = 106464211600. Its totient is φ = 95817790404.

The previous prime is 101141000971. The next prime is 101141001023. The reversal of 101141001001 is 100100141101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 101141001001 - 215 = 101140968233 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2101141001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5323210598.

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

Adding to 101141001001 its reverse (100100141101), we get a palindrome (201241142102).

The spelling of 101141001001 in words is "one hundred one billion, one hundred forty-one million, one thousand, one".

Divisors: 1 19 5323210579 101141001001