Search a number
-
+
101068752254143 = 109843920120101
BaseRepresentation
bin10110111110101111100111…
…000100110111010010111111
3111020212002010010020100002211
4112332233213010313102333
5101221402301034113033
6554542202132401251
730200655620334022
oct2676574704672277
9436762103210084
10101068752254143
112a227020877213
12b403974776227
1344519861b856b
141ad5a7a2731b9
15ba406bd292cd
hex5bebe71374bf

101068752254143 has 4 divisors (see below), whose sum is σ = 101069672484088. Its totient is φ = 101067832024200.

The previous prime is 101068752254137. The next prime is 101068752254147. The reversal of 101068752254143 is 341452257860101.

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 101068752254143 - 221 = 101068750156991 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 (101068752254147) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459950208 + ... + 460169893.

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

Almost surely, 2101068752254143 is an apocalyptic number.

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

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

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

The sum of its prime factors is 920229944.

The product of its (nonzero) digits is 1612800, while the sum is 49.

The spelling of 101068752254143 in words is "one hundred one trillion, sixty-eight billion, seven hundred fifty-two million, two hundred fifty-four thousand, one hundred forty-three".

Divisors: 1 109843 920120101 101068752254143