Search a number
-
+
920020110101 = 10154411674161
BaseRepresentation
bin11010110001101010111…
…10001100101100010101
310020221201210011001100122
431120311132030230111
5110033200122010401
61542352411521325
7123316645622321
oct15306536145425
93227653131318
10920020110101
113251a6404934
1212a380a59245
13689b03852c1
143275a224981
1518de9e1b21b
hexd63578cb15

920020110101 has 8 divisors (see below), whose sum is σ = 929300539608. Its totient is φ = 910743040000.

The previous prime is 920020110013. The next prime is 920020110103. The reversal of 920020110101 is 101011020029.

It can be written as a sum of positive squares in 4 ways, for example, as 525623550001 + 394396560100 = 724999^2 + 628010^2 .

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 920020110101 - 226 = 919953001237 is a prime.

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 920020110101.

It is a congruent number.

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

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

Almost surely, 2920020110101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1679703.

The product of its (nonzero) digits is 36, while the sum is 17.

The spelling of 920020110101 in words is "nine hundred twenty billion, twenty million, one hundred ten thousand, one hundred one".

Divisors: 1 101 5441 549541 1674161 169090261 9109110001 920020110101