Base | Representation |
---|---|
bin | 1001101110010110010… |
… | …11110001110100110111 |
3 | 1011221102111020220200010 |
4 | 10313023023301310313 |
5 | 20433240031004221 |
6 | 413254311551303 |
7 | 33065560365306 |
oct | 4671313616467 |
9 | 1157374226603 |
10 | 334121344311 |
11 | 119777874307 |
12 | 5490868b533 |
13 | 25679cc0181 |
14 | 12258a8a43d |
15 | 8a5802bc76 |
hex | 4dcb2f1d37 |
334121344311 has 32 divisors (see below), whose sum is σ = 472489504768. Its totient is φ = 209649669120.
The previous prime is 334121344289. The next prime is 334121344351. The reversal of 334121344311 is 113443121433.
It is not a de Polignac number, because 334121344311 - 25 = 334121344279 is a prime.
It is a super-2 number, since 2×3341213443112 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (334121344351) 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 in 31 ways as a sum of consecutive naturals, for example, 8903790 + ... + 8941236.
It is an arithmetic number, because the mean of its divisors is an integer number (14765297024).
Almost surely, 2334121344311 is an apocalyptic number.
334121344311 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
334121344311 is a deficient number, since it is larger than the sum of its proper divisors (138368160457).
334121344311 is a wasteful number, since it uses less digits than its factorization.
334121344311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40111.
The product of its digits is 10368, while the sum is 30.
Adding to 334121344311 its reverse (113443121433), we get a palindrome (447564465744).
The spelling of 334121344311 in words is "three hundred thirty-four billion, one hundred twenty-one million, three hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •