Base | Representation |
---|---|
bin | 10100011101101… |
… | …001011000001101 |
3 | 212221000020222201 |
4 | 110131221120031 |
5 | 1200342102411 |
6 | 54022241501 |
7 | 11336065141 |
oct | 2435513015 |
9 | 787006881 |
10 | 343315981 |
11 | 16687a418 |
12 | 96b86291 |
13 | 56185a68 |
14 | 3384b221 |
15 | 202183c1 |
hex | 1476960d |
343315981 has 2 divisors, whose sum is σ = 343315982. Its totient is φ = 343315980.
The previous prime is 343315967. The next prime is 343316021. The reversal of 343315981 is 189513343.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 217090756 + 126225225 = 14734^2 + 11235^2 .
It is a cyclic number.
It is not a de Polignac number, because 343315981 - 27 = 343315853 is a prime.
It is a super-2 number, since 2×3433159812 = 235731725619984722, which contains 22 as substring.
It is equal to p18463537 and since 343315981 and 18463537 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 343315981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (343315081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 171657990 + 171657991.
It is an arithmetic number, because the mean of its divisors is an integer number (171657991).
Almost surely, 2343315981 is an apocalyptic number.
It is an amenable number.
343315981 is a deficient number, since it is larger than the sum of its proper divisors (1).
343315981 is an equidigital number, since it uses as much as digits as its factorization.
343315981 is an evil number, because the sum of its binary digits is even.
The product of its digits is 38880, while the sum is 37.
The square root of 343315981 is about 18528.7878988346. The cubic root of 343315981 is about 700.2148870881.
The spelling of 343315981 in words is "three hundred forty-three million, three hundred fifteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •