Base | Representation |
---|---|
bin | 10100110011100… |
… | …100001111101001 |
3 | 220022211012012201 |
4 | 110303210033221 |
5 | 1203324441441 |
6 | 54345340201 |
7 | 11435656552 |
oct | 2463441751 |
9 | 808735181 |
10 | 349062121 |
11 | 16a0445a1 |
12 | 98a97661 |
13 | 57418345 |
14 | 34505329 |
15 | 209a0c31 |
hex | 14ce43e9 |
349062121 has 2 divisors, whose sum is σ = 349062122. Its totient is φ = 349062120.
The previous prime is 349062097. The next prime is 349062127. The reversal of 349062121 is 121260943.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 223173721 + 125888400 = 14939^2 + 11220^2 .
It is an emirp because it is prime and its reverse (121260943) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 349062121 - 215 = 349029353 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 349062121.
It is not a weakly prime, because it can be changed into another prime (349062127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 174531060 + 174531061.
It is an arithmetic number, because the mean of its divisors is an integer number (174531061).
Almost surely, 2349062121 is an apocalyptic number.
It is an amenable number.
349062121 is a deficient number, since it is larger than the sum of its proper divisors (1).
349062121 is an equidigital number, since it uses as much as digits as its factorization.
349062121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The square root of 349062121 is about 18683.2042487363. The cubic root of 349062121 is about 704.0998326323.
The spelling of 349062121 in words is "three hundred forty-nine million, sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •