Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …100001101100010011001 |
3 | 10220100202011102110112211 |
4 | 100002123010031202121 |
5 | 121024111434402111 |
6 | 2202145342435121 |
7 | 142424251430212 |
oct | 20023304154231 |
9 | 3810664373484 |
10 | 1102113200281 |
11 | 395449195705 |
12 | 15971b592aa1 |
13 | 7cc0c838542 |
14 | 3b4b1dcc409 |
15 | 1da06274521 |
hex | 1009b10d899 |
1102113200281 has 2 divisors, whose sum is σ = 1102113200282. Its totient is φ = 1102113200280.
The previous prime is 1102113200219. The next prime is 1102113200339. The reversal of 1102113200281 is 1820023112011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1073484560281 + 28628640000 = 1036091^2 + 169200^2 .
It is a cyclic number.
It is not a de Polignac number, because 1102113200281 - 223 = 1102104811673 is a prime.
It is a super-3 number, since 3×11021132002813 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1102113240281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551056600140 + 551056600141.
It is an arithmetic number, because the mean of its divisors is an integer number (551056600141).
Almost surely, 21102113200281 is an apocalyptic number.
It is an amenable number.
1102113200281 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102113200281 is an equidigital number, since it uses as much as digits as its factorization.
1102113200281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 1102113200281 its reverse (1820023112011), we get a palindrome (2922136312292).
The spelling of 1102113200281 in words is "one trillion, one hundred two billion, one hundred thirteen million, two hundred thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •