Base | Representation |
---|---|
bin | 10111001111011111111000… |
… | …110000010110111000101111 |
3 | 111101221010221112100010111101 |
4 | 113033133320300112320233 |
5 | 101344233231111304402 |
6 | 1001223133220503531 |
7 | 30350105241514654 |
oct | 2717377060267057 |
9 | 441833845303441 |
10 | 102220100103727 |
11 | 2a6303346aa631 |
12 | b56ab3484aba7 |
13 | 4506411052b88 |
14 | 1b3569d085c2b |
15 | bc3ea5662b87 |
hex | 5cf7f8c16e2f |
102220100103727 has 2 divisors, whose sum is σ = 102220100103728. Its totient is φ = 102220100103726.
The previous prime is 102220100103713. The next prime is 102220100103791. The reversal of 102220100103727 is 727301001022201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102220100103727 - 219 = 102220099579439 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102220100103695 and 102220100103704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102220100103227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110050051863 + 51110050051864.
It is an arithmetic number, because the mean of its divisors is an integer number (51110050051864).
Almost surely, 2102220100103727 is an apocalyptic number.
102220100103727 is a deficient number, since it is larger than the sum of its proper divisors (1).
102220100103727 is an equidigital number, since it uses as much as digits as its factorization.
102220100103727 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 28.
Adding to 102220100103727 its reverse (727301001022201), we get a palindrome (829521101125928).
The spelling of 102220100103727 in words is "one hundred two trillion, two hundred twenty billion, one hundred million, one hundred three thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.482 sec. • engine limits •