Base | Representation |
---|---|
bin | 11101001101000100011000… |
… | …10111101000001110111111 |
3 | 22102101102212102101101222111 |
4 | 32212202030113220032333 |
5 | 31404143001214423033 |
6 | 344330330212154451 |
7 | 16345535651212660 |
oct | 1646421427501677 |
9 | 272342772341874 |
10 | 64220706014143 |
11 | 1950a937350858 |
12 | 72524a0608a27 |
13 | 29aaca9707663 |
14 | 11c0427b01367 |
15 | 7657dbc0c7cd |
hex | 3a688c5e83bf |
64220706014143 has 32 divisors (see below), whose sum is σ = 75461949573120. Its totient is φ = 53499475486080.
The previous prime is 64220706014131. The next prime is 64220706014209. The reversal of 64220706014143 is 34141060702246.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 64220706014143 - 29 = 64220706013631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 64220706014096 and 64220706014105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64220706014123) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3154403398 + ... + 3154423756.
It is an arithmetic number, because the mean of its divisors is an integer number (2358185924160).
Almost surely, 264220706014143 is an apocalyptic number.
64220706014143 is a deficient number, since it is larger than the sum of its proper divisors (11241243558977).
64220706014143 is a wasteful number, since it uses less digits than its factorization.
64220706014143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33247.
The product of its (nonzero) digits is 193536, while the sum is 40.
Adding to 64220706014143 its reverse (34141060702246), we get a palindrome (98361766716389).
The spelling of 64220706014143 in words is "sixty-four trillion, two hundred twenty billion, seven hundred six million, fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •