Base | Representation |
---|---|
bin | 100010100110011001010001… |
… | …1001010110010110101001011 |
3 | 1110220121000101000100010222202 |
4 | 1011030302203022302311023 |
5 | 304342333224222013121 |
6 | 2555141431510310415 |
7 | 121051065004244213 |
oct | 10514624312626513 |
9 | 1426530330303882 |
10 | 304344120110411 |
11 | 88a78686627357 |
12 | 2a173b1a05840b |
13 | 100a86b1868354 |
14 | 5522496743243 |
15 | 252ba5055d40b |
hex | 114cca32b2d4b |
304344120110411 has 2 divisors, whose sum is σ = 304344120110412. Its totient is φ = 304344120110410.
The previous prime is 304344120110369. The next prime is 304344120110413. The reversal of 304344120110411 is 114011021443403.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 304344120110411 - 210 = 304344120109387 is a prime.
Together with 304344120110413, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (304344120110413) 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 as a sum of consecutive naturals, namely, 152172060055205 + 152172060055206.
It is an arithmetic number, because the mean of its divisors is an integer number (152172060055206).
Almost surely, 2304344120110411 is an apocalyptic number.
304344120110411 is a deficient number, since it is larger than the sum of its proper divisors (1).
304344120110411 is an equidigital number, since it uses as much as digits as its factorization.
304344120110411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 304344120110411 its reverse (114011021443403), we get a palindrome (418355141553814).
The spelling of 304344120110411 in words is "three hundred four trillion, three hundred forty-four billion, one hundred twenty million, one hundred ten thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •