Base | Representation |
---|---|
bin | 10100100011111… |
… | …001101000000101 |
3 | 220001002112211211 |
4 | 110203321220011 |
5 | 1201302033042 |
6 | 54121331421 |
7 | 11356033603 |
oct | 2443715005 |
9 | 801075754 |
10 | 344955397 |
11 | 16779a106 |
12 | 97636b71 |
13 | 5660b027 |
14 | 33b56873 |
15 | 2043e017 |
hex | 148f9a05 |
344955397 has 2 divisors, whose sum is σ = 344955398. Its totient is φ = 344955396.
The previous prime is 344955389. The next prime is 344955421. The reversal of 344955397 is 793559443.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 341473441 + 3481956 = 18479^2 + 1866^2 .
It is an emirp because it is prime and its reverse (793559443) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 344955397 - 23 = 344955389 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 344955397.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (344955307) 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, 172477698 + 172477699.
It is an arithmetic number, because the mean of its divisors is an integer number (172477699).
Almost surely, 2344955397 is an apocalyptic number.
It is an amenable number.
344955397 is a deficient number, since it is larger than the sum of its proper divisors (1).
344955397 is an equidigital number, since it uses as much as digits as its factorization.
344955397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2041200, while the sum is 49.
The square root of 344955397 is about 18572.9749097984. The cubic root of 344955397 is about 701.3276822485.
The spelling of 344955397 in words is "three hundred forty-four million, nine hundred fifty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •