Base | Representation |
---|---|
bin | 10000000011100001110… |
… | …100101000110111100001 |
3 | 10220110210220011101120121 |
4 | 100003201310220313201 |
5 | 121034024334102012 |
6 | 2202503230240241 |
7 | 142465544550121 |
oct | 20034164506741 |
9 | 3813726141517 |
10 | 1103300300257 |
11 | 3959a8290471 |
12 | 1599b1056081 |
13 | 8006b76416c |
14 | 3b585920c81 |
15 | 1da755b2a07 |
hex | 100e1d28de1 |
1103300300257 has 2 divisors, whose sum is σ = 1103300300258. Its totient is φ = 1103300300256.
The previous prime is 1103300300191. The next prime is 1103300300269. The reversal of 1103300300257 is 7520030033011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 941596588881 + 161703711376 = 970359^2 + 402124^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1103300300257 is a prime.
It is not a weakly prime, because it can be changed into another prime (1103300300357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551650150128 + 551650150129.
It is an arithmetic number, because the mean of its divisors is an integer number (551650150129).
Almost surely, 21103300300257 is an apocalyptic number.
It is an amenable number.
1103300300257 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103300300257 is an equidigital number, since it uses as much as digits as its factorization.
1103300300257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 25.
Adding to 1103300300257 its reverse (7520030033011), we get a palindrome (8623330333268).
The spelling of 1103300300257 in words is "one trillion, one hundred three billion, three hundred million, three hundred thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •