Base | Representation |
---|---|
bin | 10010101101111000000… |
… | …00011011101010110001 |
3 | 2021110222001022021021102 |
4 | 21112330000123222301 |
5 | 41014034203411131 |
6 | 1211234342134145 |
7 | 64314503561306 |
oct | 11267400335261 |
9 | 2243861267242 |
10 | 643104357041 |
11 | 228814709a73 |
12 | a477a421355 |
13 | 4884bc02013 |
14 | 231aac610ad |
15 | 11ade15e1cb |
hex | 95bc01bab1 |
643104357041 has 8 divisors (see below), whose sum is σ = 676972773600. Its totient is φ = 609238022400.
The previous prime is 643104357017. The next prime is 643104357061. The reversal of 643104357041 is 140753401346.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-643104357041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 643104356986 and 643104357004.
It is not an unprimeable number, because it can be changed into a prime (643104357011) 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 7 ways as a sum of consecutive naturals, for example, 134750 + ... + 1142088.
It is an arithmetic number, because the mean of its divisors is an integer number (84621596700).
Almost surely, 2643104357041 is an apocalyptic number.
It is an amenable number.
643104357041 is a deficient number, since it is larger than the sum of its proper divisors (33868416559).
643104357041 is a wasteful number, since it uses less digits than its factorization.
643104357041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1040959.
The product of its (nonzero) digits is 120960, while the sum is 38.
Adding to 643104357041 its reverse (140753401346), we get a palindrome (783857758387).
The spelling of 643104357041 in words is "six hundred forty-three billion, one hundred four million, three hundred fifty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •