Base | Representation |
---|---|
bin | 101010111100110… |
… | …1110101010010001 |
3 | 10201102212101012011 |
4 | 1111321232222101 |
5 | 10422421243224 |
6 | 355001502521 |
7 | 50466653422 |
oct | 12571565221 |
9 | 3642771164 |
10 | 1441196689 |
11 | 67a577449 |
12 | 3427a1a41 |
13 | 19c773c0a |
14 | d9597649 |
15 | 867d1394 |
hex | 55e6ea91 |
1441196689 has 8 divisors (see below), whose sum is σ = 1463725800. Its totient is φ = 1418839296.
The previous prime is 1441196677. The next prime is 1441196693. The reversal of 1441196689 is 9866911441.
It can be written as a sum of positive squares in 4 ways, for example, as 311699025 + 1129497664 = 17655^2 + 33608^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 1441196689 - 211 = 1441194641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1441196089) by changing a digit.
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, 25962 + ... + 59635.
It is an arithmetic number, because the mean of its divisors is an integer number (182965725).
Almost surely, 21441196689 is an apocalyptic number.
It is an amenable number.
1441196689 is a deficient number, since it is larger than the sum of its proper divisors (22529111).
1441196689 is a wasteful number, since it uses less digits than its factorization.
1441196689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85859.
The product of its digits is 373248, while the sum is 49.
The square root of 1441196689 is about 37963.0964095396. The cubic root of 1441196689 is about 1129.5559612290. Note that the first 3 decimals are identical.
The spelling of 1441196689 in words is "one billion, four hundred forty-one million, one hundred ninety-six thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •