Search a number
-
+
1166150505055 = 5832810001217
BaseRepresentation
bin10000111110000011111…
…111001001001001011111
311010111001000220121021111
4100332003333021021133
5123101234012130210
62251415552242451
7150152203512604
oct20760377111137
94114030817244
101166150505055
1140a61a616588
1216a011540427
1385c76848c63
1440628b466ab
152050316a88a
hex10f83fc925f

1166150505055 has 8 divisors (see below), whose sum is σ = 1416240613872. Its totient is φ = 921680398848.

The previous prime is 1166150505053. The next prime is 1166150505097. The reversal of 1166150505055 is 5505050516611.

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 1166150505055 - 21 = 1166150505053 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1166150504999 and 1166150505017.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1166150505053) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1405000194 + ... + 1405001023.

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

Almost surely, 21166150505055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2810001305.

The product of its (nonzero) digits is 112500, while the sum is 40.

The spelling of 1166150505055 in words is "one trillion, one hundred sixty-six billion, one hundred fifty million, five hundred five thousand, fifty-five".

Divisors: 1 5 83 415 2810001217 14050006085 233230101011 1166150505055