Base | Representation |
---|---|
bin | 10111001111011111111001… |
… | …010110111100101101000111 |
3 | 111101221010222020101002112222 |
4 | 113033133321112330231013 |
5 | 101344233241204020403 |
6 | 1001223134221402555 |
7 | 30350105423510531 |
oct | 2717377126745507 |
9 | 441833866332488 |
10 | 102220110220103 |
11 | 2a63033a38a177 |
12 | b56ab3810945b |
13 | 45064131856b5 |
14 | 1b356a055a851 |
15 | bc3ea64b0338 |
hex | 5cf7f95bcb47 |
102220110220103 has 2 divisors, whose sum is σ = 102220110220104. Its totient is φ = 102220110220102.
The previous prime is 102220110220093. The next prime is 102220110220117. The reversal of 102220110220103 is 301022011022201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102220110220103 - 24 = 102220110220087 is a prime.
It is a super-2 number, since 2×1022201102201032 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102220110220133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110055110051 + 51110055110052.
It is an arithmetic number, because the mean of its divisors is an integer number (51110055110052).
Almost surely, 2102220110220103 is an apocalyptic number.
102220110220103 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220110220103 is an equidigital number, since it uses as much as digits as its factorization.
102220110220103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 102220110220103 its reverse (301022011022201), we get a palindrome (403242121242304).
The spelling of 102220110220103 in words is "one hundred two trillion, two hundred twenty billion, one hundred ten million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •