Base | Representation |
---|---|
bin | 100110001110110… |
… | …000101001111001 |
3 | 1122200220200012200 |
4 | 212032300221321 |
5 | 2303144403023 |
6 | 143351300413 |
7 | 21615561042 |
oct | 4616605171 |
9 | 1580820180 |
10 | 641403513 |
11 | 2aa067a53 |
12 | 15a97a709 |
13 | a2b6420a |
14 | 612838c9 |
15 | 3b49a743 |
hex | 263b0a79 |
641403513 has 12 divisors (see below), whose sum is σ = 928412160. Its totient is φ = 426706776.
The previous prime is 641403493. The next prime is 641403559. The reversal of 641403513 is 315304146.
641403513 is a `hidden beast` number, since 6 + 4 + 140 + 3 + 513 = 666.
641403513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 641403513 - 212 = 641399417 is a prime.
It is a super-2 number, since 2×6414035132 = 822796932977482338, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (641407513) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 70081 + ... + 78702.
It is an arithmetic number, because the mean of its divisors is an integer number (77367680).
Almost surely, 2641403513 is an apocalyptic number.
It is an amenable number.
641403513 is a deficient number, since it is larger than the sum of its proper divisors (287008647).
641403513 is a wasteful number, since it uses less digits than its factorization.
641403513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149268 (or 149265 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 641403513 is about 25325.9454512561. The cubic root of 641403513 is about 862.4033696407.
Adding to 641403513 its reverse (315304146), we get a palindrome (956707659).
The spelling of 641403513 in words is "six hundred forty-one million, four hundred three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •