Base | Representation |
---|---|
bin | 11010000000001001101… |
… | …01011101110001111001 |
3 | 10011102002222022002021121 |
4 | 31000010311131301321 |
5 | 104114223141301131 |
6 | 1522234342105241 |
7 | 121356064302202 |
oct | 15000465356171 |
9 | 3142088262247 |
10 | 893434322041 |
11 | 3149a3423868 |
12 | 1251a141b221 |
13 | 66334450a71 |
14 | 313574065a9 |
15 | 18390e05911 |
hex | d004d5dc79 |
893434322041 has 4 divisors (see below), whose sum is σ = 896993821584. Its totient is φ = 889874822500.
The previous prime is 893434322003. The next prime is 893434322047. The reversal of 893434322041 is 140223434398.
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 893434322041 - 227 = 893300104313 is a prime.
It is a super-2 number, since 2×8934343220412 (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 (893434322047) 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, 1779749395 + ... + 1779749896.
It is an arithmetic number, because the mean of its divisors is an integer number (224248455396).
Almost surely, 2893434322041 is an apocalyptic number.
It is an amenable number.
893434322041 is a deficient number, since it is larger than the sum of its proper divisors (3559499543).
893434322041 is a wasteful number, since it uses less digits than its factorization.
893434322041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3559499542.
The product of its (nonzero) digits is 497664, while the sum is 43.
The spelling of 893434322041 in words is "eight hundred ninety-three billion, four hundred thirty-four million, three hundred twenty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •