Search a number
-
+
101141102101 = 1337192091983
BaseRepresentation
bin101111000110001111…
…0101011111000010101
3100200001200211100001111
41132030132223320111
53124114110231401
6114244044455021
710210241116534
oct1361436537025
9320050740044
10101141102101
1139991573a96
1217727b4a471
1396cb0517a0
144c7681c31b
15296e4dde51
hex178c7abe15

101141102101 has 8 divisors (see below), whose sum is σ = 108950526720. Its totient is φ = 93335868912.

The previous prime is 101141102099. The next prime is 101141102131. The reversal of 101141102101 is 101201141101.

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

It is not a de Polignac number, because 101141102101 - 21 = 101141102099 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (13).

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 2101141102101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2095715.

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

Adding to 101141102101 its reverse (101201141101), we get a palindrome (202342243202).

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

Divisors: 1 13 3719 48347 2091983 27195779 7780084777 101141102101