Base | Representation |
---|---|
bin | 111001101111110011110… |
… | …000100101100100000101 |
3 | 112001100222202010100011102 |
4 | 321233303300211210011 |
5 | 1010004132132230334 |
6 | 12235010544545445 |
7 | 556463162654231 |
oct | 71576360454405 |
9 | 15040882110142 |
10 | 3968344414469 |
11 | 129aa68a70736 |
12 | 541112622285 |
13 | 22a2a0738036 |
14 | da0d70915c1 |
15 | 6d35bd5267e |
hex | 39bf3c25905 |
3968344414469 has 2 divisors, whose sum is σ = 3968344414470. Its totient is φ = 3968344414468.
The previous prime is 3968344414459. The next prime is 3968344414471. The reversal of 3968344414469 is 9644144438693.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2378803421569 + 1589540992900 = 1542337^2 + 1260770^2 .
It is a cyclic number.
It is not a de Polignac number, because 3968344414469 - 24 = 3968344414453 is a prime.
It is a super-2 number, since 2×39683444144692 (a number of 26 digits) contains 22 as substring.
Together with 3968344414471, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3968344414429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1984172207234 + 1984172207235.
It is an arithmetic number, because the mean of its divisors is an integer number (1984172207235).
Almost surely, 23968344414469 is an apocalyptic number.
It is an amenable number.
3968344414469 is a deficient number, since it is larger than the sum of its proper divisors (1).
3968344414469 is an equidigital number, since it uses as much as digits as its factorization.
3968344414469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 214990848, while the sum is 65.
The spelling of 3968344414469 in words is "three trillion, nine hundred sixty-eight billion, three hundred forty-four million, four hundred fourteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •