Search a number
-
+
1156511015601 = 3385503671867
BaseRepresentation
bin10000110101000101011…
…011011010001010110001
311002120011020111210122120
4100311011123122022301
5122422013304444401
62243143244424453
7146361264302034
oct20650533321261
94076136453576
101156511015601
11406523355477
12168181248129
138509b754a46
143dd9282901b
152013bc70836
hex10d456da2b1

1156511015601 has 4 divisors (see below), whose sum is σ = 1542014687472. Its totient is φ = 771007343732.

The previous prime is 1156511015593. The next prime is 1156511015603. The reversal of 1156511015601 is 1065101156511.

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 1156511015601 - 23 = 1156511015593 is a prime.

It is not an unprimeable number, because it can be changed into a prime (1156511015603) 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 3 ways as a sum of consecutive naturals, for example, 192751835931 + ... + 192751835936.

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

Almost surely, 21156511015601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 385503671870.

The product of its (nonzero) digits is 4500, while the sum is 33.

The spelling of 1156511015601 in words is "one trillion, one hundred fifty-six billion, five hundred eleven million, fifteen thousand, six hundred one".

Divisors: 1 3 385503671867 1156511015601