Search a number
-
+
11842910690 = 251391099313
BaseRepresentation
bin10110000011110010…
…00111100111100010
31010120100112012022212
423001321013213202
5143223241120230
65235054402122
7566323036262
oct130171074742
933510465285
1011842910690
1150280180a6
122366200342
131169752b80
14804c097a2
15494a90895
hex2c1e479e2

11842910690 has 16 divisors (see below), whose sum is σ = 22957027128. Its totient is φ = 4372766976.

The previous prime is 11842910633. The next prime is 11842910701. The reversal of 11842910690 is 9601924811.

11842910690 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 10324795321 + 1518115369 = 101611^2 + 38963^2 .

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

It is a Curzon number.

It is an unprimeable number.

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

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

Almost surely, 211842910690 is an apocalyptic number.

11842910690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

11842910690 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 91099333.

The product of its (nonzero) digits is 31104, while the sum is 41.

The spelling of 11842910690 in words is "eleven billion, eight hundred forty-two million, nine hundred ten thousand, six hundred ninety".

Divisors: 1 2 5 10 13 26 65 130 91099313 182198626 455496565 910993130 1184291069 2368582138 5921455345 11842910690