Base | Representation |
---|---|
bin | 1001111111100111110… |
… | …00000110101100110101 |
3 | 1012211100201100222122221 |
4 | 10333303320012230311 |
5 | 21111232330044011 |
6 | 421430352522341 |
7 | 33544423506154 |
oct | 4776370065465 |
9 | 1184321328587 |
10 | 343393987381 |
11 | 1226a5a54295 |
12 | 56675b503b1 |
13 | 264c70b0313 |
14 | 1289839359b |
15 | 8dec111971 |
hex | 4ff3e06b35 |
343393987381 has 2 divisors, whose sum is σ = 343393987382. Its totient is φ = 343393987380.
The previous prime is 343393987379. The next prime is 343393987393. The reversal of 343393987381 is 183789393343.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 301473472356 + 41920515025 = 549066^2 + 204745^2 .
It is a cyclic number.
It is not a de Polignac number, because 343393987381 - 21 = 343393987379 is a prime.
It is a super-2 number, since 2×3433939873812 (a number of 24 digits) contains 22 as substring.
Together with 343393987379, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (343393787381) 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, 171696993690 + 171696993691.
It is an arithmetic number, because the mean of its divisors is an integer number (171696993691).
Almost surely, 2343393987381 is an apocalyptic number.
It is an amenable number.
343393987381 is a deficient number, since it is larger than the sum of its proper divisors (1).
343393987381 is an equidigital number, since it uses as much as digits as its factorization.
343393987381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 35271936, while the sum is 61.
The spelling of 343393987381 in words is "three hundred forty-three billion, three hundred ninety-three million, nine hundred eighty-seven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •