Base | Representation |
---|---|
bin | 1010000010000011000100… |
… | …1000100001010100011101 |
3 | 1110001111010121002002120121 |
4 | 2200200301020201110131 |
5 | 2421210023341131331 |
6 | 35243130000514541 |
7 | 2215625060600512 |
oct | 240406110412435 |
9 | 43044117062517 |
10 | 11030300333341 |
11 | 3572a18a84913 |
12 | 12a18b531ba51 |
13 | 6201caaa2893 |
14 | 2a1c2583d309 |
15 | 141dcb85ac11 |
hex | a083122151d |
11030300333341 has 2 divisors, whose sum is σ = 11030300333342. Its totient is φ = 11030300333340.
The previous prime is 11030300333281. The next prime is 11030300333359. The reversal of 11030300333341 is 14333300303011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10497736080441 + 532564252900 = 3240021^2 + 729770^2 .
It is a cyclic number.
It is not a de Polignac number, because 11030300333341 - 223 = 11030291944733 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11030300333641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515150166670 + 5515150166671.
It is an arithmetic number, because the mean of its divisors is an integer number (5515150166671).
Almost surely, 211030300333341 is an apocalyptic number.
It is an amenable number.
11030300333341 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030300333341 is an equidigital number, since it uses as much as digits as its factorization.
11030300333341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 11030300333341 its reverse (14333300303011), we get a palindrome (25363600636352).
It can be divided in two parts, 11030300 and 333341, that added together give a square (11363641 = 33712).
The spelling of 11030300333341 in words is "eleven trillion, thirty billion, three hundred million, three hundred thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •