Base | Representation |
---|---|
bin | 1001101110010001000… |
… | …01010001110011110101 |
3 | 1011221022101011010210212 |
4 | 10313020201101303311 |
5 | 20433142110224233 |
6 | 413250033555205 |
7 | 33064505442344 |
oct | 4671041216365 |
9 | 1157271133725 |
10 | 334076648693 |
11 | 119754616887 |
12 | 548b5715b05 |
13 | 25670971268 |
14 | 12252b73b5b |
15 | 8a5414da48 |
hex | 4dc8851cf5 |
334076648693 has 2 divisors, whose sum is σ = 334076648694. Its totient is φ = 334076648692.
The previous prime is 334076648611. The next prime is 334076648713. The reversal of 334076648693 is 396846670433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 330811326244 + 3265322449 = 575162^2 + 57143^2 .
It is an emirp because it is prime and its reverse (396846670433) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 334076648693 - 210 = 334076647669 is a prime.
It is a super-2 number, since 2×3340766486932 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (334076648603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 167038324346 + 167038324347.
It is an arithmetic number, because the mean of its divisors is an integer number (167038324347).
Almost surely, 2334076648693 is an apocalyptic number.
It is an amenable number.
334076648693 is a deficient number, since it is larger than the sum of its proper divisors (1).
334076648693 is an equidigital number, since it uses as much as digits as its factorization.
334076648693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47029248, while the sum is 59.
The spelling of 334076648693 in words is "three hundred thirty-four billion, seventy-six million, six hundred forty-eight thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •