Base | Representation |
---|---|
bin | 10110001100100111… |
… | …01001101010011101 |
3 | 1010202111220001010011 |
4 | 23012103221222131 |
5 | 143401221142444 |
6 | 5250302043221 |
7 | 601212420421 |
oct | 130623515235 |
9 | 33674801104 |
10 | 11916974749 |
11 | 5065904569 |
12 | 2386b79511 |
13 | 117bbb5464 |
14 | 8109a8b81 |
15 | 49b320734 |
hex | 2c64e9a9d |
11916974749 has 8 divisors (see below), whose sum is σ = 12043199160. Its totient is φ = 11790912000.
The previous prime is 11916974723. The next prime is 11916974753. The reversal of 11916974749 is 94747961911.
It can be written as a sum of positive squares in 4 ways, for example, as 6406881849 + 5510092900 = 80043^2 + 74230^2 .
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 11916974749 - 27 = 11916974621 is a prime.
It is a super-2 number, since 2×119169747492 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11916974693 and 11916974702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11916971749) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110769 + ... + 190009.
It is an arithmetic number, because the mean of its divisors is an integer number (1505399895).
Almost surely, 211916974749 is an apocalyptic number.
It is an amenable number.
11916974749 is a deficient number, since it is larger than the sum of its proper divisors (126224411).
11916974749 is a wasteful number, since it uses less digits than its factorization.
11916974749 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80831.
The product of its digits is 3429216, while the sum is 58.
The spelling of 11916974749 in words is "eleven billion, nine hundred sixteen million, nine hundred seventy-four thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •