Base | Representation |
---|---|
bin | 10100100000011… |
… | …001001100010101 |
3 | 212222100211211102 |
4 | 110200121030111 |
5 | 1201033123432 |
6 | 54045515445 |
7 | 11345154515 |
oct | 2440311425 |
9 | 788324742 |
10 | 344036117 |
11 | 167221477 |
12 | 97272b85 |
13 | 56378789 |
14 | 33997845 |
15 | 2030b962 |
hex | 14819315 |
344036117 has 2 divisors, whose sum is σ = 344036118. Its totient is φ = 344036116.
The previous prime is 344036111. The next prime is 344036131. The reversal of 344036117 is 711630443.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 248661361 + 95374756 = 15769^2 + 9766^2 .
It is an emirp because it is prime and its reverse (711630443) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-344036117 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 344036117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (344036111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 172018058 + 172018059.
It is an arithmetic number, because the mean of its divisors is an integer number (172018059).
Almost surely, 2344036117 is an apocalyptic number.
It is an amenable number.
344036117 is a deficient number, since it is larger than the sum of its proper divisors (1).
344036117 is an equidigital number, since it uses as much as digits as its factorization.
344036117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
The square root of 344036117 is about 18548.2106145040. The cubic root of 344036117 is about 700.7041329688.
The spelling of 344036117 in words is "three hundred forty-four million, thirty-six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •