Base | Representation |
---|---|
bin | 11000011111000100001… |
… | …10110100000111110001 |
3 | 2222102120111001211021211 |
4 | 30033202012310013301 |
5 | 102241001341404024 |
6 | 1442254325120121 |
7 | 114532332342220 |
oct | 14174206640761 |
9 | 2872514054254 |
10 | 841312059889 |
11 | 2a48867a7854 |
12 | 117075859041 |
13 | 61448aca222 |
14 | 2ca10cb2cb7 |
15 | 16d4009c594 |
hex | c3e21b41f1 |
841312059889 has 4 divisors (see below), whose sum is σ = 961499497024. Its totient is φ = 721124622756.
The previous prime is 841312059869. The next prime is 841312059893. The reversal of 841312059889 is 988950213148.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 841312059889 - 211 = 841312057841 is a prime.
It is a super-2 number, since 2×8413120598892 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (841312059859) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60093718557 + ... + 60093718570.
It is an arithmetic number, because the mean of its divisors is an integer number (240374874256).
Almost surely, 2841312059889 is an apocalyptic number.
It is an amenable number.
841312059889 is a deficient number, since it is larger than the sum of its proper divisors (120187437135).
841312059889 is a wasteful number, since it uses less digits than its factorization.
841312059889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120187437134.
The product of its (nonzero) digits is 4976640, while the sum is 58.
The spelling of 841312059889 in words is "eight hundred forty-one billion, three hundred twelve million, fifty-nine thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.986 sec. • engine limits •