Base | Representation |
---|---|
bin | 100110101001111110010010… |
… | …1110011001101010100101101 |
3 | 1122120220121212000220202020021 |
4 | 1031103330211303031110231 |
5 | 324031343043341301331 |
6 | 3203055101332322141 |
7 | 131422441154550100 |
oct | 11523744563152455 |
9 | 1576817760822207 |
10 | 340020310103341 |
11 | 9938289281886a |
12 | 32176269a73351 |
13 | 11795a156a18ba |
14 | 5dd70dc47a737 |
15 | 2949a9664e211 |
hex | 1353f25ccd52d |
340020310103341 has 48 divisors (see below), whose sum is σ = 400682481494400. Its totient is φ = 287680906171008.
The previous prime is 340020310103179. The next prime is 340020310103399. The reversal of 340020310103341 is 143301013020043.
It is not a de Polignac number, because 340020310103341 - 213 = 340020310095149 is a prime.
It is a super-2 number, since 2×3400203101033412 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (340020310103641) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 892070895 + ... + 892451971.
It is an arithmetic number, because the mean of its divisors is an integer number (8347551697800).
Almost surely, 2340020310103341 is an apocalyptic number.
It is an amenable number.
340020310103341 is a deficient number, since it is larger than the sum of its proper divisors (60662171391059).
340020310103341 is a wasteful number, since it uses less digits than its factorization.
340020310103341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381986 (or 381979 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 340020310103341 its reverse (143301013020043), we get a palindrome (483321323123384).
The spelling of 340020310103341 in words is "three hundred forty trillion, twenty billion, three hundred ten million, one hundred three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •