Base | Representation |
---|---|
bin | 100110011110110… |
… | …101001000001101 |
3 | 1122222211200211221 |
4 | 212132311020031 |
5 | 2310234204031 |
6 | 144021443341 |
7 | 21666434542 |
oct | 4636651015 |
9 | 1588750757 |
10 | 645616141 |
11 | 301484a65 |
12 | 160270551 |
13 | a39aa7b1 |
14 | 61a5cbc9 |
15 | 3ba2da11 |
hex | 267b520d |
645616141 has 4 divisors (see below), whose sum is σ = 673686432. Its totient is φ = 617545852.
The previous prime is 645616129. The next prime is 645616159. The reversal of 645616141 is 141616546.
645616141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 645616141 - 211 = 645614093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 645616097 and 645616106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (645616171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14035111 + ... + 14035156.
It is an arithmetic number, because the mean of its divisors is an integer number (168421608).
Almost surely, 2645616141 is an apocalyptic number.
It is an amenable number.
645616141 is a deficient number, since it is larger than the sum of its proper divisors (28070291).
645616141 is a wasteful number, since it uses less digits than its factorization.
645616141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28070290.
The product of its digits is 17280, while the sum is 34.
The square root of 645616141 is about 25408.9775669939. The cubic root of 645616141 is about 864.2872902395.
The spelling of 645616141 in words is "six hundred forty-five million, six hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •