Base | Representation |
---|---|
bin | 10110010010111110… |
… | …01110010000000001 |
3 | 1010220020022021021001 |
4 | 23021133032100001 |
5 | 144003401333331 |
6 | 5255445532001 |
7 | 602431131655 |
oct | 131137162001 |
9 | 33806267231 |
10 | 11970339841 |
11 | 5092a43549 |
12 | 23a0a14001 |
13 | 1189c7b435 |
14 | 817adaa65 |
15 | 4a0d62561 |
hex | 2c97ce401 |
11970339841 has 4 divisors (see below), whose sum is σ = 11971340500. Its totient is φ = 11969339184.
The previous prime is 11970339839. The next prime is 11970339851. The reversal of 11970339841 is 14893307911.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14893307911 = 54673 ⋅272407.
It can be written as a sum of positive squares in 2 ways, for example, as 11898446400 + 71893441 = 109080^2 + 8479^2 .
It is a cyclic number.
It is not a de Polignac number, because 11970339841 - 21 = 11970339839 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11970339791 and 11970339800.
It is not an unprimeable number, because it can be changed into a prime (11970339851) 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, 482166 + ... + 506383.
It is an arithmetic number, because the mean of its divisors is an integer number (2992835125).
Almost surely, 211970339841 is an apocalyptic number.
It is an amenable number.
11970339841 is a deficient number, since it is larger than the sum of its proper divisors (1000659).
11970339841 is an equidigital number, since it uses as much as digits as its factorization.
11970339841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000658.
The product of its (nonzero) digits is 163296, while the sum is 46.
The spelling of 11970339841 in words is "eleven billion, nine hundred seventy million, three hundred thirty-nine thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •