Search a number
-
+
161606115106099 = 295572624658831
BaseRepresentation
bin100100101111101011011011…
…000101011001110100110011
3210012012101122000122002210021
4210233223123011121310303
5132140223310431343344
61331412454021544311
746016441120342506
oct4457533305316463
9705171560562707
10161606115106099
114754684aa07464
1216160420b75097
136c235117b8731
142bc9ac604913d
1513a3b2c729b84
hex92fadb159d33

161606115106099 has 4 divisors (see below), whose sum is σ = 167178739764960. Its totient is φ = 156033490447240.

The previous prime is 161606115106081. The next prime is 161606115106133. The reversal of 161606115106099 is 990601511606161.

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 161606115106099 - 27 = 161606115105971 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2161606115106099 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5572624658860.

The product of its (nonzero) digits is 524880, while the sum is 52.

The spelling of 161606115106099 in words is "one hundred sixty-one trillion, six hundred six billion, one hundred fifteen million, one hundred six thousand, ninety-nine".

Divisors: 1 29 5572624658831 161606115106099