Base | Representation |
---|---|
bin | 1010010011101110111101… |
… | …1101110101111000001011 |
3 | 1111010112101210110122222112 |
4 | 2210323233131311320023 |
5 | 2441144310133214311 |
6 | 40034455503212535 |
7 | 2246602405333256 |
oct | 244735735657013 |
9 | 44115353418875 |
10 | 11334141304331 |
11 | 367a8673164aa |
12 | 1330770ba714b |
13 | 642a605b2391 |
14 | 2b280ab3a09d |
15 | 149c6132a28b |
hex | a4eef775e0b |
11334141304331 has 2 divisors, whose sum is σ = 11334141304332. Its totient is φ = 11334141304330.
The previous prime is 11334141304271. The next prime is 11334141304363. The reversal of 11334141304331 is 13340314143311.
It is an a-pointer prime, because the next prime (11334141304363) can be obtained adding 11334141304331 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11334141304331 - 218 = 11334141042187 is a prime.
It is a super-2 number, since 2×113341413043312 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11334141304391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5667070652165 + 5667070652166.
It is an arithmetic number, because the mean of its divisors is an integer number (5667070652166).
Almost surely, 211334141304331 is an apocalyptic number.
11334141304331 is a deficient number, since it is larger than the sum of its proper divisors (1).
11334141304331 is an equidigital number, since it uses as much as digits as its factorization.
11334141304331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
Adding to 11334141304331 its reverse (13340314143311), we get a palindrome (24674455447642).
The spelling of 11334141304331 in words is "eleven trillion, three hundred thirty-four billion, one hundred forty-one million, three hundred four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •