Search a number
-
+
1158268740061 = 4326936482327
BaseRepresentation
bin10000110110101110001…
…100100110000111011101
311002201200201222110022111
4100312232030212013131
5122434113244140221
62244033514514021
7146452656563116
oct20665614460735
94081621873274
101158268740061
11407245564914
12168591a35911
13852bb9625a4
14400bc05920d
15201e1227be1
hex10dae3261dd

1158268740061 has 4 divisors (see below), whose sum is σ = 1185205222432. Its totient is φ = 1131332257692.

The previous prime is 1158268740047. The next prime is 1158268740089. The reversal of 1158268740061 is 1600478628511.

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 1158268740061 - 25 = 1158268740029 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 21158268740061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 26936482370.

The product of its (nonzero) digits is 645120, while the sum is 49.

The spelling of 1158268740061 in words is "one trillion, one hundred fifty-eight billion, two hundred sixty-eight million, seven hundred forty thousand, sixty-one".

Divisors: 1 43 26936482327 1158268740061