Base | Representation |
---|---|
bin | 10111011011001001000010… |
… | …011111100001100011011011 |
3 | 111111202122010221120010111221 |
4 | 113123021002133201203123 |
5 | 102000340332441401021 |
6 | 1003034454350232511 |
7 | 30461651423122645 |
oct | 2733110237414333 |
9 | 444678127503457 |
10 | 103020201122011 |
11 | 2a909692890908 |
12 | b67a008ab5737 |
13 | 45639bcc0b684 |
14 | 1b622c09c5895 |
15 | bd9bd275b241 |
hex | 5db2427e18db |
103020201122011 has 2 divisors, whose sum is σ = 103020201122012. Its totient is φ = 103020201122010.
The previous prime is 103020201122009. The next prime is 103020201122081. The reversal of 103020201122011 is 110221102020301.
It is a weak prime.
It is an emirp because it is prime and its reverse (110221102020301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103020201122011 - 21 = 103020201122009 is a prime.
It is a super-2 number, since 2×1030202011220112 (a number of 29 digits) contains 22 as substring.
Together with 103020201122009, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (103020201122081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510100561005 + 51510100561006.
It is an arithmetic number, because the mean of its divisors is an integer number (51510100561006).
Almost surely, 2103020201122011 is an apocalyptic number.
103020201122011 is a deficient number, since it is larger than the sum of its proper divisors (1).
103020201122011 is an equidigital number, since it uses as much as digits as its factorization.
103020201122011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 103020201122011 its reverse (110221102020301), we get a palindrome (213241303142312).
The spelling of 103020201122011 in words is "one hundred three trillion, twenty billion, two hundred one million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •