Base | Representation |
---|---|
bin | 10010101110001001100… |
… | …00010000000001111101 |
3 | 2021111100021110002111200 |
4 | 21113010300100001331 |
5 | 41014334241010023 |
6 | 1211301103410113 |
7 | 64321235135451 |
oct | 11270460200175 |
9 | 2244307402450 |
10 | 643251110013 |
11 | 22888a533716 |
12 | a47bb5b3939 |
13 | 48873434cb5 |
14 | 231c2542661 |
15 | 11aebe9b743 |
hex | 95c4c1007d |
643251110013 has 12 divisors (see below), whose sum is σ = 983795815548. Its totient is φ = 403608539520.
The previous prime is 643251109981. The next prime is 643251110059. The reversal of 643251110013 is 310011152346.
It is a happy number.
643251110013 is a `hidden beast` number, since 6 + 4 + 32 + 511 + 100 + 13 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 557587771524 + 85663338489 = 746718^2 + 292683^2 .
It is not a de Polignac number, because 643251110013 - 25 = 643251109981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (643251110413) 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, 2102127658 + ... + 2102127963.
It is an arithmetic number, because the mean of its divisors is an integer number (81982984629).
Almost surely, 2643251110013 is an apocalyptic number.
It is an amenable number.
643251110013 is a deficient number, since it is larger than the sum of its proper divisors (340544705535).
643251110013 is a wasteful number, since it uses less digits than its factorization.
643251110013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4204255644 (or 4204255641 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 643251110013 its reverse (310011152346), we get a palindrome (953262262359).
The spelling of 643251110013 in words is "six hundred forty-three billion, two hundred fifty-one million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •