Base | Representation |
---|---|
bin | 11111011001011100100010… |
… | …10011001010000010000101 |
3 | 100001110112201122120210120112 |
4 | 33230232101103022002011 |
5 | 33022204141433020344 |
6 | 402502220454442405 |
7 | 20354160413150024 |
oct | 1754562123120205 |
9 | 301415648523515 |
10 | 69044037001349 |
11 | 1aaaa458a05123 |
12 | 78b1244363405 |
13 | 2c6aa94c98b17 |
14 | 1309a6bc128bb |
15 | 7eaed9399c9e |
hex | 3ecb914ca085 |
69044037001349 has 2 divisors, whose sum is σ = 69044037001350. Its totient is φ = 69044037001348.
The previous prime is 69044037001321. The next prime is 69044037001351. The reversal of 69044037001349 is 94310073044096.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65817767224225 + 3226269777124 = 8112815^2 + 1796182^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-69044037001349 is a prime.
Together with 69044037001351, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 69044037001297 and 69044037001306.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (69044037001319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34522018500674 + 34522018500675.
It is an arithmetic number, because the mean of its divisors is an integer number (34522018500675).
Almost surely, 269044037001349 is an apocalyptic number.
It is an amenable number.
69044037001349 is a deficient number, since it is larger than the sum of its proper divisors (1).
69044037001349 is an equidigital number, since it uses as much as digits as its factorization.
69044037001349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1959552, while the sum is 50.
The spelling of 69044037001349 in words is "sixty-nine trillion, forty-four billion, thirty-seven million, one thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •