Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
11390494569 = 34754379861
BaseRepresentation
bin10101001101110110…
…10010011101101001
31002101211020002002020
422212323102131221
5141311431311234
65122133455053
7552160414656
oct124673223551
932354202066
1011390494569
114915701183
12225a7a1489
1310c6abb51c
147a0abcc2d
15469ec6549
hex2a6ed2769

11390494569 has 8 divisors (see below), whose sum is σ = 15187835712. Its totient is φ = 7593408240.

The previous prime is 11390494567. The next prime is 11390494613. The reversal of 11390494569 is 96549409311.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 11390494569 - 21 = 11390494567 is a prime.

It is a super-3 number, since 3×113904945693 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

Almost surely, 211390494569 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 127407.

The product of its (nonzero) digits is 1049760, while the sum is 51.

The spelling of 11390494569 in words is "eleven billion, three hundred ninety million, four hundred ninety-four thousand, five hundred sixty-nine".

Divisors: 1 3 47543 79861 142629 239583 3796831523 11390494569