Base | Representation |
---|---|
bin | 10100110011010… |
… | …101001000010101 |
3 | 220022201001021211 |
4 | 110303111020111 |
5 | 1203321001323 |
6 | 54344141421 |
7 | 11435311222 |
oct | 2463251025 |
9 | 808631254 |
10 | 349000213 |
11 | 16a002031 |
12 | 98a67871 |
13 | 573c6103 |
14 | 344ca949 |
15 | 2098c70d |
hex | 14cd5215 |
349000213 has 2 divisors, whose sum is σ = 349000214. Its totient is φ = 349000212.
The previous prime is 349000207. The next prime is 349000231. The reversal of 349000213 is 312000943.
Together with next prime (349000231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 287879089 + 61121124 = 16967^2 + 7818^2 .
It is a cyclic number.
It is not a de Polignac number, because 349000213 - 217 = 348869141 is a prime.
It is a super-2 number, since 2×3490002132 = 243602297348090738, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (349000313) 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, 174500106 + 174500107.
It is an arithmetic number, because the mean of its divisors is an integer number (174500107).
Almost surely, 2349000213 is an apocalyptic number.
It is an amenable number.
349000213 is a deficient number, since it is larger than the sum of its proper divisors (1).
349000213 is an equidigital number, since it uses as much as digits as its factorization.
349000213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
The square root of 349000213 is about 18681.5473930828. The cubic root of 349000213 is about 704.0582049038.
The spelling of 349000213 in words is "three hundred forty-nine million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •