Base | Representation |
---|---|
bin | 1011111111111000… |
… | …00000101000101001 |
3 | 121121220122021110102 |
4 | 11333330000220221 |
5 | 101142444424334 |
6 | 2543101355145 |
7 | 315424016216 |
oct | 57774005051 |
9 | 17556567412 |
10 | 6441404969 |
11 | 280600698a |
12 | 12b9268ab5 |
13 | 7b867653c |
14 | 4516b0b0d |
15 | 27a77967e |
hex | 17ff00a29 |
6441404969 has 2 divisors, whose sum is σ = 6441404970. Its totient is φ = 6441404968.
The previous prime is 6441404953. The next prime is 6441404971. The reversal of 6441404969 is 9694041446.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3550729744 + 2890675225 = 59588^2 + 53765^2 .
It is a cyclic number.
It is not a de Polignac number, because 6441404969 - 24 = 6441404953 is a prime.
It is a super-2 number, since 2×64414049692 = 82983395949315781922, which contains 22 as substring.
Together with 6441404971, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (6441404069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3220702484 + 3220702485.
It is an arithmetic number, because the mean of its divisors is an integer number (3220702485).
Almost surely, 26441404969 is an apocalyptic number.
It is an amenable number.
6441404969 is a deficient number, since it is larger than the sum of its proper divisors (1).
6441404969 is an equidigital number, since it uses as much as digits as its factorization.
6441404969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 746496, while the sum is 47.
The square root of 6441404969 is about 80258.3638569838. The cubic root of 6441404969 is about 1860.6307808758.
The spelling of 6441404969 in words is "six billion, four hundred forty-one million, four hundred four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •