Search a number
-
+
10370641163101 = 29357608315969
BaseRepresentation
bin1001011011101001101001…
…1000011111001101011101
31100201102102210222011212121
42112322122120133031131
52324403033114204401
634020112355302541
72120153104266532
oct226723230371535
940642383864777
1010370641163101
11333918963574a
1211b5a968aaa51
135a2c411b040b
1427bd280a6d89
1512eb6e161ca1
hex96e9a61f35d

10370641163101 has 4 divisors (see below), whose sum is σ = 10728249479100. Its totient is φ = 10013032847104.

The previous prime is 10370641163089. The next prime is 10370641163107. The reversal of 10370641163101 is 10136114607301.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 4762738816900 + 5607902346201 = 2182370^2 + 2368101^2 .

It is a cyclic number.

It is not a de Polignac number, because 10370641163101 - 211 = 10370641161053 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 (10370641163107) by changing a digit.

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

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

Almost surely, 210370641163101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 357608315998.

The product of its (nonzero) digits is 9072, while the sum is 34.

The spelling of 10370641163101 in words is "ten trillion, three hundred seventy billion, six hundred forty-one million, one hundred sixty-three thousand, one hundred one".

Divisors: 1 29 357608315969 10370641163101