Base | Representation |
---|---|
bin | 10010110001110011000… |
… | …01001101101101110001 |
3 | 2021200101210122020012012 |
4 | 21120321201031231301 |
5 | 41032342241241031 |
6 | 1212223323412305 |
7 | 64420623245306 |
oct | 11307141155561 |
9 | 2250353566165 |
10 | 645210102641 |
11 | 2296a5311895 |
12 | a5067684095 |
13 | 48ac6252130 |
14 | 2332a7a50ad |
15 | 11bb3e5db2b |
hex | 963984db71 |
645210102641 has 16 divisors (see below), whose sum is σ = 724048491600. Its totient is φ = 570843936768.
The previous prime is 645210102587. The next prime is 645210102659. The reversal of 645210102641 is 146201012546.
645210102641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 52778170225 + 592431932416 = 229735^2 + 769696^2 .
It is not a de Polignac number, because 645210102641 - 210 = 645210101617 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 645210102598 and 645210102607.
It is not an unprimeable number, because it can be changed into a prime (645210102241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6194456 + ... + 6297753.
It is an arithmetic number, because the mean of its divisors is an integer number (45253030725).
Almost surely, 2645210102641 is an apocalyptic number.
It is an amenable number.
645210102641 is a deficient number, since it is larger than the sum of its proper divisors (78838388959).
645210102641 is a wasteful number, since it uses less digits than its factorization.
645210102641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12492388.
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 645210102641 in words is "six hundred forty-five billion, two hundred ten million, one hundred two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •