Base | Representation |
---|---|
bin | 100111000011011110100101… |
… | …1010000101100100100001011 |
3 | 1200001022201200221022020000102 |
4 | 1032012331023100230210023 |
5 | 330011310443231412021 |
6 | 3214341255140000015 |
7 | 132233623254336434 |
oct | 11606751320544413 |
9 | 1601281627266012 |
10 | 343525631904011 |
11 | 9a504447573607 |
12 | 3264169b09000b |
13 | 1198b435a6cb3b |
14 | 60b8a2d2a448b |
15 | 29aad53ce600b |
hex | 1386f4b42c90b |
343525631904011 has 2 divisors, whose sum is σ = 343525631904012. Its totient is φ = 343525631904010.
The previous prime is 343525631903947. The next prime is 343525631904053. The reversal of 343525631904011 is 110409136525343.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 343525631904011 - 26 = 343525631903947 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (343525631904071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 171762815952005 + 171762815952006.
It is an arithmetic number, because the mean of its divisors is an integer number (171762815952006).
Almost surely, 2343525631904011 is an apocalyptic number.
343525631904011 is a deficient number, since it is larger than the sum of its proper divisors (1).
343525631904011 is an equidigital number, since it uses as much as digits as its factorization.
343525631904011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1166400, while the sum is 47.
The spelling of 343525631904011 in words is "three hundred forty-three trillion, five hundred twenty-five billion, six hundred thirty-one million, nine hundred four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •