Base | Representation |
---|---|
bin | 1001000110011100110110110… |
… | …1010101111000000110001101 |
3 | 10002222111202002011001110012212 |
4 | 2101213031231111320012031 |
5 | 1132420000244400243023 |
6 | 10150012554152040205 |
7 | 251615130355512332 |
oct | 22147155525700615 |
9 | 3088452064043185 |
10 | 640411523056013 |
11 | 1760670022a89a5 |
12 | 5b9b0063393065 |
13 | 21645716b05557 |
14 | b420124054989 |
15 | 4e08890241e78 |
hex | 246736d57818d |
640411523056013 has 8 divisors (see below), whose sum is σ = 681691745419200. Its totient is φ = 599888735965728.
The previous prime is 640411523056007. The next prime is 640411523056031. The reversal of 640411523056013 is 310650325114046.
640411523056013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 640411523056013 - 218 = 640411522793869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (640411523056073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189358816481 + ... + 189358819862.
It is an arithmetic number, because the mean of its divisors is an integer number (85211468177400).
Almost surely, 2640411523056013 is an apocalyptic number.
It is an amenable number.
640411523056013 is a deficient number, since it is larger than the sum of its proper divisors (41280222363187).
640411523056013 is a wasteful number, since it uses less digits than its factorization.
640411523056013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378717636451.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 640411523056013 in words is "six hundred forty trillion, four hundred eleven billion, five hundred twenty-three million, fifty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •