Search a number
-
+
1156027215601 = 1916052498511
BaseRepresentation
bin10000110100101000100…
…101110110111011110001
311002111220112011012211001
4100310220211312323301
5122420020431344401
62243023243122001
7146343301126306
oct20645045667361
94074815135731
101156027215601
114062a5253365
12168067213301
138502245255b
143dd4848d0ad
152010e557601
hex10d28976ef1

1156027215601 has 4 divisors (see below), whose sum is σ = 1162079714304. Its totient is φ = 1149974716900.

The previous prime is 1156027215599. The next prime is 1156027215611. The reversal of 1156027215601 is 1065127206511.

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 1156027215601 - 21 = 1156027215599 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21156027215601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6052498702.

The product of its (nonzero) digits is 25200, while the sum is 37.

The spelling of 1156027215601 in words is "one trillion, one hundred fifty-six billion, twenty-seven million, two hundred fifteen thousand, six hundred one".

Divisors: 1 191 6052498511 1156027215601