Search a number
-
+
1150104556641 = 33527108695261
BaseRepresentation
bin10000101111000111100…
…100101101010001100001
311001221121202121222002210
4100233013210231101201
5122320403231303031
62240203432032333
7146043443301105
oct20570744552141
94057552558083
101150104556641
11403836047a97
12166a938326a9
13845ba3c5821
143d945a53905
151edb45ea746
hex10bc792d461

1150104556641 has 8 divisors (see below), whose sum is σ = 1533907537344. Its totient is φ = 766518973520.

The previous prime is 1150104556603. The next prime is 1150104556651. The reversal of 1150104556641 is 1466554010511.

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 1150104556641 - 211 = 1150104554593 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1150104556641.

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

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

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

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

Almost surely, 21150104556641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 108698791.

The product of its (nonzero) digits is 72000, while the sum is 39.

The spelling of 1150104556641 in words is "one trillion, one hundred fifty billion, one hundred four million, five hundred fifty-six thousand, six hundred forty-one".

Divisors: 1 3 3527 10581 108695261 326085783 383368185547 1150104556641