Base | Representation |
---|---|
bin | 10010101000010111000… |
… | …01000010010001011111 |
3 | 2021012022200121211202120 |
4 | 21110023201002101133 |
5 | 40442003143232133 |
6 | 1210024445154023 |
7 | 64151230403424 |
oct | 11241341022137 |
9 | 2235280554676 |
10 | 640143336543 |
11 | 227535252497 |
12 | a409285b913 |
13 | 48499617999 |
14 | 22da98c3d4b |
15 | 119b9219ab3 |
hex | 950b84245f |
640143336543 has 4 divisors (see below), whose sum is σ = 853524448728. Its totient is φ = 426762224360.
The previous prime is 640143336493. The next prime is 640143336557. The reversal of 640143336543 is 345633341046.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 640143336543 - 216 = 640143271007 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640143336495 and 640143336504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (640143336743) 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 3 ways as a sum of consecutive naturals, for example, 106690556088 + ... + 106690556093.
It is an arithmetic number, because the mean of its divisors is an integer number (213381112182).
Almost surely, 2640143336543 is an apocalyptic number.
640143336543 is a deficient number, since it is larger than the sum of its proper divisors (213381112185).
640143336543 is a wasteful number, since it uses less digits than its factorization.
640143336543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213381112184.
The product of its (nonzero) digits is 933120, while the sum is 42.
Adding to 640143336543 its reverse (345633341046), we get a palindrome (985776677589).
The spelling of 640143336543 in words is "six hundred forty billion, one hundred forty-three million, three hundred thirty-six thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •