Base | Representation |
---|---|
bin | 100111000001111011010011… |
… | …0111101100000100110001001 |
3 | 1200000120100100222021120011021 |
4 | 1032003312212331200212021 |
5 | 324444312320013411241 |
6 | 3214055314400032441 |
7 | 132212334601224535 |
oct | 11603664675404611 |
9 | 1600510328246137 |
10 | 343312422013321 |
11 | 9a431a870a9a82 |
12 | 326082b7602721 |
13 | 119742b7a40ac7 |
14 | 60ac5a4a1cbc5 |
15 | 29a5525cb00d1 |
hex | 1383da6f60989 |
343312422013321 has 16 divisors (see below), whose sum is σ = 347945448892608. Its totient is φ = 338703649704000.
The previous prime is 343312422013303. The next prime is 343312422013331. The reversal of 343312422013321 is 123310224213343.
It is a cyclic number.
It is not a de Polignac number, because 343312422013321 - 27 = 343312422013193 is a prime.
It is a super-2 number, since 2×3433124220133212 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (343312422013331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1343187466 + ... + 1343443036.
It is an arithmetic number, because the mean of its divisors is an integer number (21746590555788).
Almost surely, 2343312422013321 is an apocalyptic number.
It is an amenable number.
343312422013321 is a deficient number, since it is larger than the sum of its proper divisors (4633026879287).
343312422013321 is a wasteful number, since it uses less digits than its factorization.
343312422013321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 302952.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 343312422013321 its reverse (123310224213343), we get a palindrome (466622646226664).
The spelling of 343312422013321 in words is "three hundred forty-three trillion, three hundred twelve billion, four hundred twenty-two million, thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •