Base | Representation |
---|---|
bin | 10010101000010010010… |
… | …11001011101110001011 |
3 | 2021012012221201001202100 |
4 | 21110021023023232023 |
5 | 40441413114204033 |
6 | 1210020523204443 |
7 | 64150242453135 |
oct | 11241113135613 |
9 | 2235187631670 |
10 | 640104053643 |
11 | 22751506168a |
12 | a4081676723 |
13 | 48491442672 |
14 | 22da45ba055 |
15 | 119b5a5a513 |
hex | 95092cbb8b |
640104053643 has 48 divisors (see below), whose sum is σ = 936918455616. Its totient is φ = 421095628800.
The previous prime is 640104053639. The next prime is 640104053671. The reversal of 640104053643 is 346350401046.
640104053643 is a `hidden beast` number, since 6 + 4 + 0 + 1 + 0 + 4 + 0 + 5 + 3 + 643 = 666.
It is not a de Polignac number, because 640104053643 - 22 = 640104053639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 640104053598 and 640104053607.
It is not an unprimeable number, because it can be changed into a prime (640104054643) 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 47 ways as a sum of consecutive naturals, for example, 132881971 + ... + 132886787.
It is an arithmetic number, because the mean of its divisors is an integer number (19519134492).
Almost surely, 2640104053643 is an apocalyptic number.
640104053643 is a deficient number, since it is larger than the sum of its proper divisors (296814401973).
640104053643 is a wasteful number, since it uses less digits than its factorization.
640104053643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5604 (or 5601 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
Adding to 640104053643 its reverse (346350401046), we get a palindrome (986454454689).
The spelling of 640104053643 in words is "six hundred forty billion, one hundred four million, fifty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •