Search a number
-
+
106277075121 = 375060813101
BaseRepresentation
bin110001011111010011…
…0110111100010110001
3101011022122001210112110
41202332212313202301
53220123412400441
6120453434315533
710451434143030
oct1427646674261
9334278053473
10106277075121
1141087702598
121871bb88ba9
13a03910a789
145202996717
152b70353b16
hex18be9b78b1

106277075121 has 8 divisors (see below), whose sum is σ = 161946019264. Its totient is φ = 60729757200.

The previous prime is 106277075119. The next prime is 106277075147. The reversal of 106277075121 is 121570772601.

It is a happy number.

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

It is not a de Polignac number, because 106277075121 - 21 = 106277075119 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 106277075121.

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

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

Almost surely, 2106277075121 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5060813111.

The product of its (nonzero) digits is 41160, while the sum is 39.

The spelling of 106277075121 in words is "one hundred six billion, two hundred seventy-seven million, seventy-five thousand, one hundred twenty-one".

Divisors: 1 3 7 21 5060813101 15182439303 35425691707 106277075121