Base | Representation |
---|---|
bin | 1001111111011101110… |
… | …00101000101001010101 |
3 | 1012211010212210012022201 |
4 | 10333232320220221111 |
5 | 21111044410142331 |
6 | 421414201524501 |
7 | 33542355615535 |
oct | 4775670505125 |
9 | 1184125705281 |
10 | 343310240341 |
11 | 122662753962 |
12 | 56651aa3731 |
13 | 264b293a563 |
14 | 1288b1d34c5 |
15 | 8de4abca61 |
hex | 4feee28a55 |
343310240341 has 4 divisors (see below), whose sum is σ = 343326972672. Its totient is φ = 343293508012.
The previous prime is 343310240303. The next prime is 343310240381. The reversal of 343310240341 is 143042013343.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 343310240341 - 219 = 343309716053 is a prime.
It is a super-2 number, since 2×3433102403412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (343310240381) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8335351 + ... + 8376436.
It is an arithmetic number, because the mean of its divisors is an integer number (85831743168).
Almost surely, 2343310240341 is an apocalyptic number.
It is an amenable number.
343310240341 is a deficient number, since it is larger than the sum of its proper divisors (16732331).
343310240341 is a wasteful number, since it uses less digits than its factorization.
343310240341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16732330.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 343310240341 its reverse (143042013343), we get a palindrome (486352253684).
The spelling of 343310240341 in words is "three hundred forty-three billion, three hundred ten million, two hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •