Base | Representation |
---|---|
bin | 1100000000010010… |
… | …01001011001101101 |
3 | 121122011010020102211 |
4 | 12000021021121231 |
5 | 101144340124444 |
6 | 2543303250421 |
7 | 315465211333 |
oct | 60011113155 |
9 | 17564106384 |
10 | 6444848749 |
11 | 2807a49289 |
12 | 12ba449a11 |
13 | 7b92b0b91 |
14 | 451d29b53 |
15 | 27ac09c34 |
hex | 18024966d |
6444848749 has 2 divisors, whose sum is σ = 6444848750. Its totient is φ = 6444848748.
The previous prime is 6444848747. The next prime is 6444848783. The reversal of 6444848749 is 9478484446.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6098516649 + 346332100 = 78093^2 + 18610^2 .
It is a cyclic number.
It is not a de Polignac number, because 6444848749 - 21 = 6444848747 is a prime.
Together with 6444848747, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 6444848693 and 6444848702.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6444848747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3222424374 + 3222424375.
It is an arithmetic number, because the mean of its divisors is an integer number (3222424375).
Almost surely, 26444848749 is an apocalyptic number.
It is an amenable number.
6444848749 is a deficient number, since it is larger than the sum of its proper divisors (1).
6444848749 is an equidigital number, since it uses as much as digits as its factorization.
6444848749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 24772608, while the sum is 58.
The square root of 6444848749 is about 80279.8153273910. The cubic root of 6444848749 is about 1860.9623059358.
The spelling of 6444848749 in words is "six billion, four hundred forty-four million, eight hundred forty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •