Search a number
-
+
10160666120013 = 33386888706671
BaseRepresentation
bin1001001111011011011011…
…1001010000111101001101
31022222100110021212210200220
42103312312321100331031
52312433021011320023
633335425013341553
72066040531003333
oct223666671207515
938870407783626
1010160666120013
113268129155a92
1211812566378b9
135891ba4014a6
14271ac92bbb53
1512948010e3e3
hex93db6e50f4d

10160666120013 has 4 divisors (see below), whose sum is σ = 13547554826688. Its totient is φ = 6773777413340.

The previous prime is 10160666119999. The next prime is 10160666120023. The reversal of 10160666120013 is 31002166606101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 10160666120013 - 24 = 10160666119997 is a prime.

It is a super-3 number, since 3×101606661200133 (a number of 40 digits) contains 333 as substring.

It is a congruent number.

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

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

Almost surely, 210160666120013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3386888706674.

The product of its (nonzero) digits is 7776, while the sum is 33.

The spelling of 10160666120013 in words is "ten trillion, one hundred sixty billion, six hundred sixty-six million, one hundred twenty thousand, thirteen".

Divisors: 1 3 3386888706671 10160666120013