Search a number
-
+
11555951489 = 78714683547
BaseRepresentation
bin10101100001100100…
…11101001110000001
31002211100120011022022
422300302131032001
5142131310421424
65150404051225
7556236652445
oct126062351601
932740504268
1011555951489
1149a0040435
1222a6093b15
13112216ca24
147b8a6c825
154797aa95e
hex2b0c9d381

11555951489 has 4 divisors (see below), whose sum is σ = 11570635824. Its totient is φ = 11541267156.

The previous prime is 11555951471. The next prime is 11555951497. The reversal of 11555951489 is 98415955511.

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 11555951489 - 212 = 11555947393 is a prime.

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

It is a Duffinian number.

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

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

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

Almost surely, 211555951489 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14684334.

The product of its digits is 1620000, while the sum is 53.

The spelling of 11555951489 in words is "eleven billion, five hundred fifty-five million, nine hundred fifty-one thousand, four hundred eighty-nine".

Divisors: 1 787 14683547 11555951489