Base | Representation |
---|---|
bin | 10110010010110101… |
… | …11011110111001101 |
3 | 1010220011012011120102 |
4 | 23021122323313031 |
5 | 144003104402244 |
6 | 5255405500445 |
7 | 602415441215 |
oct | 131132736715 |
9 | 33804164512 |
10 | 11969215949 |
11 | 5092346109 |
12 | 23a0571725 |
13 | 1189976a02 |
14 | 8178c7245 |
15 | 4a0bde54e |
hex | 2c96bbdcd |
11969215949 has 4 divisors (see below), whose sum is σ = 11969606460. Its totient is φ = 11968825440.
The previous prime is 11969215901. The next prime is 11969215957. The reversal of 11969215949 is 94951296911.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94951296911 = 23 ⋅4128317257.
It can be written as a sum of positive squares in 2 ways, for example, as 5866794025 + 6102421924 = 76595^2 + 78118^2 .
It is a cyclic number.
It is not a de Polignac number, because 11969215949 - 28 = 11969215693 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11969215894 and 11969215903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11969215549) 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, 144962 + ... + 212019.
It is an arithmetic number, because the mean of its divisors is an integer number (2992401615).
Almost surely, 211969215949 is an apocalyptic number.
It is an amenable number.
11969215949 is a deficient number, since it is larger than the sum of its proper divisors (390511).
11969215949 is an equidigital number, since it uses as much as digits as its factorization.
11969215949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390510.
The product of its digits is 1574640, while the sum is 56.
The spelling of 11969215949 in words is "eleven billion, nine hundred sixty-nine million, two hundred fifteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •