Base | Representation |
---|---|
bin | 10100101000010… |
… | …010101000001101 |
3 | 220010021000200212 |
4 | 110220102220031 |
5 | 1202100401011 |
6 | 54202132205 |
7 | 11401566335 |
oct | 2450225015 |
9 | 803230625 |
10 | 346106381 |
11 | 168405935 |
12 | 97ab1065 |
13 | 56921b9a |
14 | 33d760c5 |
15 | 205ba08b |
hex | 14a12a0d |
346106381 has 2 divisors, whose sum is σ = 346106382. Its totient is φ = 346106380.
The previous prime is 346106363. The next prime is 346106419. The reversal of 346106381 is 183601643.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 337456900 + 8649481 = 18370^2 + 2941^2 .
It is a cyclic number.
It is not a de Polignac number, because 346106381 - 26 = 346106317 is a prime.
It is a super-2 number, since 2×3461063812 = 239579253937834322, which contains 22 as substring.
It is equal to p18605552 and since 346106381 and 18605552 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (346106311) 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, 173053190 + 173053191.
It is an arithmetic number, because the mean of its divisors is an integer number (173053191).
Almost surely, 2346106381 is an apocalyptic number.
It is an amenable number.
346106381 is a deficient number, since it is larger than the sum of its proper divisors (1).
346106381 is an equidigital number, since it uses as much as digits as its factorization.
346106381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 346106381 is about 18603.9345569694. The cubic root of 346106381 is about 702.1068369038.
The spelling of 346106381 in words is "three hundred forty-six million, one hundred six thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •