Search a number
-
+
11156367361 = 41702738723
BaseRepresentation
bin10100110001111100…
…01010100000000001
31001210111200011221011
422120332022200001
5140322012223421
65043011400521
7543315362236
oct123076124001
931714604834
1011156367361
114805529a17
1221b42b3141
13108a445809
1477b97578d
1545467a4e1
hex298f8a801

11156367361 has 8 divisors (see below), whose sum is σ = 11430395424. Its totient is φ = 10882430880.

The previous prime is 11156367359. The next prime is 11156367377. The reversal of 11156367361 is 16376365111.

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 11156367361 - 21 = 11156367359 is a prime.

It is a super-2 number, since 2×111563673612 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 211156367361 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 45791.

The product of its digits is 68040, while the sum is 40.

The spelling of 11156367361 in words is "eleven billion, one hundred fifty-six million, three hundred sixty-seven thousand, three hundred sixty-one".

Divisors: 1 41 7027 38723 288107 1587643 272106521 11156367361